Binary Search Tree : Lowest Common Ancestor

  • + 0 comments
    Node *lca(Node *root, int v1,int v2) {
        while(root){
        if(v1<root->data&&v2<root->data)
        root=root->left;
        else if(v1>root->data&&v2>root->data)
        root=root->right;
        else
        return root;
    }
    return NULL;
    }