Write a function to get the intersection point of two Linked Lists
- Intersection point means end of one linked list is linked with some node in another linked list.
![data- linked-list](https://cdn.wikitechy.com/interview-questions/data-structure/intersection-linked-list.png)
Given two Linked Lists, create intersection lists that contain intersection of the elements present in the given lists.
Example
Sample Code in C:
Code Explanation :
- Get count of the nodes in the first list, let count be c1.
- Get count of the nodes in the second list, let count be c2.
- Get the difference of counts d = abs (c1 – c2)
- Now traverse the bigger list from the first node till d nodes so that from here onwards both the lists have equal no of nodes.
- Then we can traverse both the lists in parallel till we come across a common node. (Note that getting a common node is done by comparing the address of the nodes)
Time Complexity: O(m+n)
Auxiliary Space: O(1)
Output :
The node of intersection is 15