Choose the invariant or failure response implied by each operation contract. Verify the working program against a direct reference model.
Lessons
- BK-trees: search incident labels within edit distance
- Vantage-point trees: nearest depots by a metric radius
- Centroid decomposition: nearest marked depot on a fixed tree
- Two-level perfect hashing: exact static case membership
