lowest common ancestor

1.

stack overflow using inorder  n postorder

2. Given two singly linked lists and they both intersect at one point (ie, forming a Y shaped list). Find where the two linked lists merge.

link: treating it as linked list 

.