Construct a kd-tree.
data : array_like, shape (n,k)
The data points to be indexed. This array is not copied, and so modifying this data will result in bogus results.
leafsize : positive int
The number of points at which the algorithm switches over to brute-force.
Enter search terms or a module, class or function name.