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

  • fede92
     + 5 comments

    I think in this counter example it wouldnt work:

    v1 is 1 and v2 is 7

        4       
  /   \
2       6
 \     /  \
  3   5    7    
     /
    1

    Answer we would get is 4 and the correct answer is 6.