KD Tree
In plain terms
A binary tree partitioning multidimensional points for fast search.
Going deeper
A k-d tree splits points along alternating dimensions, enabling fast nearest-neighbor and range searches in multidimensional space. It organizes spatial data for queries.
Under the hood
Efficient in low dimensions but degrades in high dimensions (the curse of dimensionality); supports kNN search.
Examples
Nearest-neighbor search, kNN, spatial databases, ray tracing, robotics.
Think of it like...
Like sorting a library first by floor, then aisle, then shelf to zero in on a book.