intersection of two linked list

Given two linked linked list and they are intersecting at some node.Suggest an algorithm to find that intersecting node.
Y ShapedLinked List


  1. let A and B be 2 linked list.
    Make a copy of A(say C)such that data part of a node in C keeps the pointer to the next node in A.
    Reverse B. Keep traversing A and C simultaneously. If at any point the data part of C and next node pointer of A are different, then that is the required node.

  2. @jainendra try without using any extra space...

  3. start comparing the addresses at the point where the lists are at the same height(in this case at value 9 and 10) that's at list1.length-list2.length index. O(n) time.


Post a Comment

Popular posts from this blog