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

  • lenhuang720
     + 0 comments

    Had a similar thing with C but I'm getting seg faults. Any ideas? It works for half the test cases;

    struct node *lca(struct node *root, int v1, int v2) {
    if(root != NULL && root->data < v1 && root->data < v2){
        return lca(root->left, v1, v2);
    }
    if(root != NULL && root->data > v1 && root->data > v2){
        return lca(root->right, v1, v2);
    }
    else return root;
}