Binary Search Tree : Lowest Common Ancestor

  • + 0 comments

    No, for a tree: 8 4 9 1 6 2 5 7 3. It should look like this: (forgiven me about my bad indentation)

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