Lowest Common Ancestor of a Binary Tree

Given a binary tree (level-order form, unique values) and two values p and q that exist in the tree, print the value of their lowest common ancestor.

2 <= number of nodes <= 10^5 All values are unique