Tree Topic Wise Problem-Solving Questions
1. Basic Tree Operations
| S.No | Problem Statement | Difficulty | LeetCode | GeeksforGeeks |
|---|---|---|---|---|
| 1 | Tree Node Structure Implementation | Easy | - | Link |
| 2 | Tree Traversal (Inorder, Preorder, Postorder) | Easy | Link | Link |
| 3 | Level Order Traversal | Easy | Link | Link |
| 4 | Calculate Tree Height | Easy | - | Link |
| 5 | Count Leaf Nodes | Easy | Link | Link |
2. Binary Search Trees
| S.No | Problem Statement | Difficulty | LeetCode | GeeksforGeeks |
|---|---|---|---|---|
| 1 | Search in a BST | Easy | Link | Link |
| 2 | Insert into a BST | Medium | Link | Link |
| 3 | Delete Node in a BST | Medium | Link | Link |
| 4 | Validate BST | Medium | Link | Link |
| 5 | BST Iterator | Medium | Link | Link |
3. Tree Traversal Techniques
| S.No | Problem Statement | Difficulty | LeetCode | GeeksforGeeks |
|---|---|---|---|---|
| 1 | Inorder Traversal (Iterative) | Medium | Link | Link |
| 2 | Preorder Traversal (Iterative) | Medium | Link | Link |
| 3 | Postorder Traversal (Iterative) | Hard | Link | Link |
| 4 | Morris Traversal | Hard | - | Link |
| 5 | Zigzag Level Order Traversal | Medium | Link | Link |
4. Tree Properties and Validation
| S.No | Problem Statement | Difficulty | LeetCode | GeeksforGeeks |
|---|---|---|---|---|
| 1 | Check for Balanced Tree | Easy | Link | Link |
| 2 | Check for Symmetric Tree | Easy | Link | Link |
| 3 | Check for Subtree | Medium | Link | Link |
| 4 | Check for Same Tree | Easy | Link | Link |
| 5 | Check for Complete Tree | Medium | Link | Link |
5. Tree Construction and Conversion
| S.No | Problem Statement | Difficulty | LeetCode | GeeksforGeeks |
|---|---|---|---|---|
| 1 | Construct Tree from Inorder and Preorder | Medium | Link | Link |
| 2 | Construct Tree from Inorder and Postorder | Medium | Link | Link |
| 3 | Construct BST from Preorder | Medium | Link | Link |
| 4 | Convert Sorted Array to BST | Easy | Link | Link |
| 5 | Flatten Binary Tree to Linked List | Medium | Link | Link |
6. Tree Path Problems
| S.No | Problem Statement | Difficulty | LeetCode | GeeksforGeeks |
|---|---|---|---|---|
| 1 | Maximum Depth of Binary Tree | Easy | Link | Link |
| 2 | Minimum Depth of Binary Tree | Easy | Link | Link |
| 3 | Diameter of Binary Tree | Easy | Link | Link |
| 4 | Binary Tree Maximum Path Sum | Hard | Link | Link |
| 5 | Path Sum | Easy | Link | Link |
7. Advanced Tree Problems
| S.No | Problem Statement | Difficulty | LeetCode | GeeksforGeeks |
|---|---|---|---|---|
| 1 | Serialize and Deserialize Binary Tree | Hard | Link | Link |
| 2 | Lowest Common Ancestor | Medium | Link | Link |
| 3 | Binary Tree Cameras | Hard | Link | Link |
| 4 | Recover Binary Search Tree | Medium | Link | Link |
| 5 | Vertical Order Traversal | Hard | Link | Link |
Related Tree Resources