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

  • sarathy_v_krish1
     + 1 comment

    C++ solution :

    Node *lca(Node *root, int v1,int v2) {
		// Write your code here.
        while((v1>root->data && v2>root->data) || (v1<root->data && v2<root->data))
        {
            if (v1>root->data) root=root->right;
            else root=root->left;
        }
        return root;
    }