- BST to sorted list
- Build tree from inorder and preorder
- Build tree from preorder
- Check if given tree is BST
- Check if tree is balanced
- Complete subtree
- Find a pair with given sum
- Find all paths with givn sum
- Find common ancestor of 2 nodes
- Foldable binary tree
- InOrder successor
- InOrder successor from parent node
- Maximum width of tree
- Merge 2 BSTs
- Populate sibling pointer
- Remove nodes outside a given range
- Serialization of tree
- Sorted list to BST
- Traversal in spiral order
- Traversal without recursion
- Traversal without recursion or stacks
- Traversals
- Tree diameter
- Tree printing
**How to remember this stuff?**