@@ -0,0 +1,619 @@
+/*%0A  Insert Node at the end of a linked list%0A  head pointer input could be NULL as well for empty list%0A  Node is defined as%0A  class Node %7B%0A     int data;%0A     Node next;%0A  %7D%0A*/%0Aint FindMergeNode(Node headA, Node headB) %7B%0A%0A    // Make two temp nodes to iterate through lists%0A    Node currA = headA;%0A    Node currB = headB;%0A%0A    while (currA != currB)%7B // Stop when nodes find merge%0A        if (currA.next == null) %7BcurrA = headB; %7D // Jump A node to list B%0A        if (currB.next == null) %7BcurrB = headA; %7D // Jump B node to list A%0A        currA = currA.next;%0A        currB = currB.next;%0A    %7D%0A%0A    return currA.data;%0A%7D%0A

solve find the merge point