Lowest common ancestor of a binary tree
Given a binary tree (no ordering on the values) and two of its nodes, return their lowest common ancestor: the deepest node that has both in its subtree.
No answer yet. Write the first one; the best answer gets endorsed.