k-d Tree
Tree used to store spatial data.
- Nearest neighbor search.
- Range queries.
- Fast look-up
k-d tree are guaranteed log2 n depth where n is the number of points in the set.
- Traditionally, k-d trees store points in d-dimensional space which are equivalent to vectors in d-dimensional space.