Binary Search Tree : Lowest Common Ancestor

  • + 0 comments

    Node *lca(Node *root, int v1,int v2) {

        if(v1>root->data && v2>root->data)
        root = lca(root->right,v1,v2);
        if(v1<root->data && v2<root->data)
        root = lca(root->left,v1,v2);
        return root;
    
    }