Loading
Binary trees, BSTs, and the four traversals — plus the recursive shape that solves most tree problems in six lines.
The four orders, iteratively and recursively.
Invariants, bounds, and why parent checks fail.
Rebuilding a tree from its traversals.
This build ships a representative sample of the catalogue rather than every problem in it.