0 votes

Suppose there are two singly linked lists both of which intersect at some point

and become a single linked list. The head or start pointers of both the lists are known, but

the intersecting node is not known. Also, the number of nodes in each of the lists before

they intersect is unknown and may be different in each list. List1 may have n nodes before

it reaches the intersection point, and List2 might have m nodes before it reaches the

intersection point where m and n may be m = n,m < n or m > n. Give an algorithm for

finding the merging point. And find the time complexity and space complexity also.