Working with Graphs & Trees

What tree relationship is this algorithm finding?

function findLCA(root, p, q) {
  if (!root || root === p || root === q) return root;
  
  const left = findLCA(root.left, p, q);
  const right = findLCA(root.right, p, q);
  
  if (left && right) return root;
  return left || right;
}

Height difference
Common ancestors
Lowest Common Ancestor
This finds the Lowest Common Ancestor because: 1) Recursively searches both subtrees for target nodes, 2) Returns root if both nodes are in different subtrees, 3) Returns found node if one target is ancestor of other, 4) Handles cases where one node is the LCA, 5) Uses post-order traversal approach, 6) Optimal O(n) time complexity, 7) Common in hierarchical relationship problems, 8) Important for distance and relationship calculations in trees.
Node distance

Next Question (12/21)