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