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

  • zazublue00
     + 0 comments

    why do we traverse left when both v1 and v2 are greater than root? Should we not traverse left?

    I am rusty with the concepts

Join us

Create a HackerRank account

Be part of a 26 million-strong community of developers

Already have an account?Log in