public Node GetIntersectionNode(Node headA, Node headB)
{
if(headA ==null || headB==null)
{
return null;
}
var a = headA;
var b = headB;
while(a != b)
{
a = a == null ? headB : a.next;
b = b == null ? headA : b.next;
}
return a;
}