Choose the claim supported by each indexed or queued operation. Separate an in-memory teaching model from a durable service boundary.
Lessons
- Red-black trees: audit color and black-height invariants
- B-trees: split full pages during ordered insertion
- Interval trees: prune overlap search with subtree maximums
- Compressed tries: split shared edge labels at the divergence
- Bounded thread queues: separate FIFO removal from task completion