Microsoft

Lowest Common Ancestor (LC 235) with a Follow-Up Variant

Members only

Start with LC 235 and find the lowest common ancestor of two nodes in a binary search tree. The follow-up removes the BST ordering guarantee and becomes the general binary-tree problem in LC 236.