Trees

KD-Tree

Partitions points by alternating axes for spatial search; each two-digit number represents an XY point.

Learn with an interactive visualization

Category: Trees. Complexity: Average O(log n).

Partitions points by alternating axes for spatial search; each two-digit number represents an XY point. Interactive visualization, Java and C++ code,…