Introduction - If you have any usage issues, please Google them yourself
KD tree program, from a 2-D to k-dimensional data retrieval. kd Tree (k-dimensional search tree) is to be extended to multidimensional binary search tree data structure of a main memory data. kd tree is a binary tree, whose internal nodes are associated by an attribute a and a value v, the data points will be divided into two parts: a part is less than v and v a value greater than or equal parts. Since all the properties in layer-dimensional cycle, so the trees on the property in the different layers are different.