Binary Search Tree : Lowest Common Ancestor

  • + 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.

    • + 1 comment

      you have given the end 'return root' in else condition where as it should be returned in every condition. just remove last else...

      • + 0 comments

        Yep my code works fine. Root is returned only in the condition when above if's are not matching. I am taking about the code at very top of the page. For me it's not giving proper results. Like it gives the last common ancestor rater then immidiate one.