KD Tree

KD tree is a data structure for organizing points in a k-dimensional space, commonly used to make spatial searches faster

For example, if you have 2D points like:

(3, 4), (7, 2), (1, 9), (6, 8)