I have gone through this [link](https://stackoverflow.com/questions/2216666/finding-the-intersecting-node-from-two-intersecting-linked-lists) where accepted
 answer depict below algorith to find merging node

> 
> 1) Traverse the two linked list to find M and N.
> 
> 
> 2) Get back to the heads, then traverse |M - N| nodes on the longer
>  list.
> 
> 
> 3) Now walk in lock step and compare the nodes until you found the
>  common ones.
> 
> 
> 

I am not sure will it always work? Foe example :- list 1 has 10 nodes and list 2 has 3 nodes where very first node is merging node(**so in shape letter "V" upside down**). Now if i go by above
algo,

> 
> 1)M= 10, N=3
> 
> 
> 2)M-N will be 7
> 
> 
> 3)I pick list 1 and traverse first 7 nodes. Now i start comparing each
>  node starting from 8th node in list1 with the all the nodes of second
>  list.
> 
> 
> 

Now i will never catch the merging node (which is the very first node here) . Am i missing something in my undestanding or there is some flaw in this algo?