Trees & BST
Hierarchies, ordered searches, and the paths between nodes.
Trees & BST progress0 / 14
- Tree BasicsOne root, many branches, and no way back up.4m
- Binary TreesAt most two children: one left, one right, never swapped.4m
- Tree TraversalsSame nodes, same recursion, three different reading orders.5m
- BST BasicsSmaller values left, larger values right, all the way down.5m
- BST Insert and SearchOne comparison per level throws away half the tree.5m
- Validate a BSTChecking the parent is not enough; carry a range down.6m
- Tree Depth and BalanceHeight decides speed, and balance decides height.5m
- Lowest Common AncestorWalk down from the root until the two targets part ways.6m
- Level Order TraversalA queue turns a tree into one tidy row per depth.5m
- Diameter of a TreeThe longest path bends at exactly one node — find that node.6m
- Path Sum VariantsSame tree, three questions — and three different things to carry.6m
- Serialize a TreeWrite the gaps down and the shape survives the trip.6m
- Vertical Order TraversalGive every node an x-coordinate and read the tree in columns.6m
- Rebuild From TraversalsPreorder names the root, inorder says where to cut.6m
Quiz yourself: 3 questions from this module
1 / 3