- Level order traversalEasy✓ Solved1 approach
- Find the Lowest Common Ancestor in a Binary TreeMedium✓ Solved2 approaches
- Diameter of a Binary TreeEasy✓ Solved1 approach
- All tree traversals — inorder, preorder, postorder (recursive & iterative), level order, zig-zagEasy✓ Solved3 approaches
- Height, balance check, and mirror of a treeEasy✓ Solved2 approaches
- Tree views — left, right, top, bottom, diagonal, boundaryMedium✓ Solved3 approaches
- Construct a binary tree from inorder + preorderMedium✓ Solved1 approach
- Construct a binary tree from its bracket string representationMedium✓ Solved1 approach
- Convert a binary tree to a doubly linked list (in-order)Medium✓ Solved1 approach
- Convert a binary tree to a sum tree / check if it is a sum treeMedium✓ Solved1 approach
- LCA, distance between two nodes, and Kth ancestor in a binary treeMedium✓ Solved1 approach
- Path sums — longest root-to-leaf sum, largest subtree sum, max non-adjacent sum, K-sum pathsMedium✓ Solved4 approaches
- Checks — leaves at same level, duplicate subtrees, is-a-tree (graph), min swaps to BSTMedium✓ Solved3 approaches
- Check if all levels of two trees are anagramsEasy✓ Solved1 approach
- Same TreeEasy✓ Solved1 approach
- Path Sum IIMedium✓ Solved1 approach
- Count Good Nodes in Binary TreeMedium✓ Solved1 approach
- Binary Tree Maximum Path SumHard✓ Solved1 approach
- Serialize and Deserialize Binary TreeHard✓ Solved1 approach