Given a binary tree and two nodes p and q, find the lowest common ancestor (LCA) of the two nodes. The LCA is defined as the lowest node in the tree that has both p and q as descendants.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.