Back to Patterns
7
Trees
A Tree is a hierarchical data structure consisting of nodes. Binary Trees (and Binary Search Trees) are incredibly common in technical interviews. Solutions usually heavily rely on recursion and Depth-First Search (DFS) or Breadth-First Search (BFS).
Problems (18)
- Balanced Binary TreeDifficulty: Easy
- Binary Tree Level Order TraversalDifficulty: Medium
- Binary Tree Maximum Path SumDifficulty: Hard
- Binary Tree Inorder TraversalDifficulty: Easy
- Binary Tree Right Side ViewDifficulty: Medium
- Binary Tree Zigzag Level Order TraversalDifficulty: Medium
- Construct Binary Tree from Preorder and Inorder TraversalDifficulty: Medium
- Count Good Nodes in Binary TreeDifficulty: Medium
- Diameter of Binary TreeDifficulty: Easy
- Invert Binary TreeDifficulty: Easy
- Kth Smallest Element in a BSTDifficulty: Medium
- Lowest Common Ancestor of a Binary Search TreeDifficulty: Medium
- Lowest Common Ancestor of a Binary TreeDifficulty: Medium
- Maximum Depth of Binary TreeDifficulty: Easy
- Same TreeDifficulty: Easy
- Serialize and Deserialize Binary TreeDifficulty: Hard
- Subtree of Another TreeDifficulty: Easy
- Validate Binary Search TreeDifficulty: Medium