This was pretty straightforward. I wrote an algorithm that did an exhaustive search by traversing the whole tree for some target element; if the element is found, it returns the path it took from the root to the element. To get the answer, run this search on the two target elements and compare their paths. The two nodes' common ancestor is the last node in the search path that are equal.