Lowest common ancestor in an N-ary tree
Given the root of an N-ary tree and two of its nodes, return their lowest common ancestor. Use one depth-first pass in which each subtree reports whether it contains each of the two nodes.
No answer yet. Write the first one; the best answer gets endorsed.
