My implementation of K-Dimensional Tree. K-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space.
Supported operations:
- Insert - method KdTree.insert(Node)
- Search - method KdTree.search(Node)
- Delete - method KdTree.delete(Node)