Phase 16Days 84-87

Binary Search Trees

Use the BST ordering property for fast search/insert/delete and the classic problems

Phase Goal

Exploit the left<node<right invariant, and know when to just use std::set/map.

Progress

Day 84: BST fundamentals

Day 85: Deletion & order statistics

Day 86: BST problems

Day 87: BST capstone & recap

Phase Complete!

After this phase, you'll be able to:

  • BST fundamentals
  • Deletion & order statistics
  • BST problems
  • BST capstone & recap

After Phase 16, explain a core invariant, reconstruct a solution after a delay, diagnose a bug, and solve one unlabelled variation. Repair a failed prerequisite before advancing; record help separately from independent work.