sentences:  Perhaps the simplest is the k-d tree, which iteratively bisects the search space into two regions containing half of the points of the parent region.Queries are performed via traversal of the tree from the root to a leaf by evaluating the query point at each split.Depending on the distance specified in the query, neighboring branches that might contain hits may also need to be evaluated.