Solution: Lowest Common Ancestor of a Binary Tree
Solution: Lowest Common Ancestor of a Binary Tree asks you to find the lowest node shared as an ancestor by two given nodes in a binary tree, with either node allowed to be its own ancestor.
We'll cover the following...
We'll cover the following...
Statement
Given the root node of a binary tree with nodes, your task is to find the lowest common ancestor of two of its nodes, p and q.
Note: The lowest common ancestor of two nodes,
pandq, is defined as the lowest node in the binary tree that has bothpandqas descendants.A node can also be a descendant of itself. For example, if
qis a descendant ofp, and we know thatpis a descendant of itself, thenpwill be the lowest common ancestor ofpandq.
Constraints: