Check what each mutation actually preserves. Separate sorted output from structural correctness, and in-memory versioning from an atomic service update.
Lessons
- Red-black insertion: rotate and recolor an ordered index
- B+ trees: propagate leaf splits through multiple levels
- Balanced interval indexes: rotate height and maximum metadata together
- Compressed tries: delete exact keys and merge unused edges
- Persistent segment trees: retain old range-sum versions