Opening page…
Recursive thinking on hierarchical data: traversals, height-based DFS, BST ordering, and tree reconstruction.
Solved
| Solved | # | Problem | Pattern | Level | Preview |
|---|---|---|---|---|---|
| 1 | Binary Tree Inorder Traversal | DFS · Stack | Easy | ||
| 2 | Maximum Depth of Binary Tree | DFS · BFS | Easy | ||
| 3 | Invert Binary Tree | DFS | Easy | ||
| 4 | Diameter of Binary Tree | DFS · Tree DP | Easy | ||
| 5 | Binary Tree Level Order Traversal | BFS | Medium | ||
| 6 | Binary Tree Zigzag Level Order Traversal | BFS | Medium | ||
| 7 | Binary Tree Right Side View | BFS · DFS | Medium | ||
| 8 | Validate Binary Search Tree | BST · DFS | Medium | ||
| 9 | Kth Smallest Element in a BST | BST · Inorder | Medium | ||
| 10 | Lowest Common Ancestor of a Binary Tree | DFS · LCA | Medium |
Showing 1–10 of 14 problems