Trees
Traverse and manipulate hierarchical data structures.
8
Problems
0
Easy
8
Medium
0
Hard
When to Use Trees
Pattern Recognition
Look for these trigger words in problem statements:
invert binary tree
trees
maximum depth of binary tree
validate binary search tree
lowest common ancestor of a binary search tree
binary tree level order traversal
binary tree right side view
serialize and deserialize binary tree
binary tree maximum path sum
Practice Problems
Invert Binary Tree
medium
Maximum Depth of Binary Tree
medium
Validate Binary Search Tree
medium
Lowest Common Ancestor of a Binary Search Tree
medium
Binary Tree Level Order Traversal
medium
Binary Tree Right Side View
medium
Serialize and Deserialize Binary Tree
medium
Binary Tree Maximum Path Sum
medium
Master Trees
Build pattern recognition with interactive MCQs. Understand why to use Trees, not just how.
Download LeetEye Free