We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Trees
  4. Binary Search Tree : Lowest Common Ancestor
  5. Discussions

Binary Search Tree : Lowest Common Ancestor

  • safee7
     + 0 comments

    C++ `14 Solution:

             
//O(h) - h is height of the binary search tree ----> O(log(n))
//Worst case (Skewed BST): Height h = n -- O(n). 
    Node *lca(Node *root, int v1,int v2) {
        if(root == nullptr) return root;
        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 root;
    }