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