LeetCode Q&A: Trees
Binary trees, BSTs and tree algorithms
Easy
15 problems
Medium
25 problems
Hard
8 problems
Common Trees Patterns
Traversal Types
- Inorder (LNR)
- Preorder (NLR)
- Postorder (LRN)
- Level-order (BFS)
Common Problems
- Max/min depth
- Diameter
- Lowest common ancestor
- Validate BST
Coming Soon
Detailed solutions with multiple approaches, time/space complexity analysis, and video explanations.