# BBD Tree ANN Search: Explained
BBD Tree ANN Search shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Alternate splitting and shrinking boxes so every cell has bounded aspect ratio, then return a point whose distance is within (1+eps) of the nearest neighbor.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(log n) + (1/eps)^d query time in fixed dimension d.
## Common mistake
Skipping the shrink step, which lets a long skinny cell survive and ruins the aspect-ratio argument used for the (1+eps) bound.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI tool for job interviews.