Least Common Ancestor in a Tree with only Parent pointers
Given a tree with only children pointing to the parents, find the least common ancestor of 2 nodes.
Just another WordPress weblog
Given a tree with only children pointing to the parents, find the least common ancestor of 2 nodes.
This can be considered as a form of http://cstechie.com/find-intersection-point-of-2-linked-lists/
So I guess the same solution works here.