Binary Tree: Easy to Hard Problems
Easy
- Maximum Depth of Binary Tree
- Symmetric Tree
- Invert Binary Tree
- Path Sum
- Same Tree
- Binary Tree Level Order Traversal
- Balanced Binary Tree
- Minimum Depth of Binary Tree
Medium
- Binary Tree Inorder Traversal
- Binary Tree Zigzag Level Order Traversal
- Binary Tree Right Side View
- Construct Binary Tree from Preorder and Inorder Traversal
- Kth Smallest Element in a BST
- Validate Binary Search Tree
- Flatten Binary Tree to Linked List
- Lowest Common Ancestor of a Binary Tree
- Populating Next Right Pointers in Each Node
- Path Sum II
Hard
- Binary Tree Maximum Path Sum
- Serialize and Deserialize Binary Tree
- Recover Binary Search Tree
- Binary Tree Cameras
- Largest BST Subtree
- Lowest Common Ancestor of a Binary Tree III
- Construct Binary Tree from Inorder and Postorder Traversal
- Smallest Rectangle Enclosing Black Pixels
- Sum of Distances in Tree
- Count of Smaller Numbers After Self