Find in a k-D Tree

find(<x1,x2, …, xk>, root) finds the node which has the given set of keys in it or returns null if there is no such node

Node *& find(const keyVector & keys,

Node *& root) {

int dim = root->dimension;

if (root == NULL)

return root;

else if (root->keys == keys)

return root;

else if (keys[dim] < root->keys[dim])

return find(keys, root->left);

else

return find(keys, root->right);

}

runtime: