A KD-Tree (K-Dimensional Tree)

[bomenderick]

A K-D Tree (also known as a K-Dimensional Tree) is a binary search tree where each node contains a K-Dimensional point in space. Essentially, it is a space-partitioning data structure used to organize points in a K-Dimensional space, which facilitates the search for nearest neighbors.

In addition to the basic operations of insertion, search, and deletion, this implementation also supports nearest neighbor searches and median finding to maintain balance during insertions. Furthermore, it includes a merge method that allows the combination of two K-D Trees by gathering their points and constructing a balanced K-D Tree from them.

Read more:

https://www.geeksforgeeks.org/search-and-insertion-in-k-dimensional-tree/
https://www.geeksforgeeks.org/deletion-in-k-dimensional-tree/