Binary Search Tree : Lowest Common Ancestor

  • + 0 comments

    The example input given to the problem in the description has Node 5 on left of Root node 1.

    Which I do think will fail your solution.