úÎ ŸÔNoneMÁThe k-d tree is a data structure capable of efficiently answering nearest neighbor search queries in low-dimensional spaces. As a rule of thumb, for efficient lookups the number of points in k# dimensions should greatly exceed 2^k Construct a KdTree from a vector of points)Find the point nearest to the given pointList all points in a tree#Verify that the node is well-formed1Verify that the tree is well-formed (recursively)&Given names for the axes show the tree           kd-tree-0.1.0 Data.KdTreeKdTree fromVectornearesttoListisValid showKdTree nodeIsValidKdEmptyKdNodepointaxisleftright quadranceToonAxis