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