Kd-trees are data structures which are used to store points in k-dimensional space. As it follows its name, kd-tree is a tree. Tree leafs store points of the dataset (one or several points in each leaf). Each point is stored in one and only one leaf,