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

  • Moghaak
     + 1 comment

    Thanks.

    That's what I was looking at right now when I was solving the problem from Cracking the Coding Interview. Also, if I use the simple code snippet given at the top, my cases are failing. It is not returning me with the immidiate common ancester. It is rather returning the very top node.

    Please comment on this issue, is it just me? Or we have a problem in the code above?

    Yep I guess I need to add one more if condition namely if v1 or v2 is equal to root->data, return root.

    Thanks.