In a tree structure of parent/child nodes, with 2 starting points, while "walking" up the tree, how would you programmatically determine the lowest common denominator node? You cannot determine a whether a parent node has a child or how many children it has.