Tree: Depth-First Search - Lowest Common Ancestor of Binary Tree
Given the parent-pointer + ancestor set approach, if the tree is:
and p=2, q=8, which node will be returned as their Lowest Common Ancestor?
3 / \ 5 1 / \ / \ 6 2 0 8
and p=2, q=8, which node will be returned as their Lowest Common Ancestor?
