![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1644926625068-118.The%20intersection%20of%20two%20Sorted%20Linked%20Lists_Artboard%201.png\")
<\/p>\n<\/p>\n
We have already seen how union in linked lists work.Now in the insertion there are two linked lists which are given where we have to traverse through those lists to find a common node which is also equal. Then that node is called an intersecting node. Now in this article lets just look into the approach of intersection of two sorted linked lists <\/p>\n
In this problem, we are given two sorted linked lists and are asked to print a single linked list that contains the common intersection from the two lists. <\/p>\n
Let me make this more clear with an example test case: Linked list 2<\/strong>:<\/p>\n The resultant Linked List after the intersection of the above lists 1 and 2 will be:<\/p>\n Let’s first understand the problem statement with the help of an example:<\/p>\n If Linked list 1<\/strong> = 0\u21923\u21924\u21928 and Linked list 2<\/strong> = 4\u21928\u21929. So, our final intersection list will be 4 \u2192 8.<\/p>\n If Linked list 1<\/strong> = 6\u21922\u21923\u21929 and Linked list 2<\/strong> = 2\u21923\u21929.<\/p>\n So, our final intersection list will be 2 \u2192 3 \u2192 9.<\/p>\n Now, I think from the above examples, it is clear what we are trying to find in this problem. So next we will try to think how we can approach this problem.<\/p>\n Before jumping to the next section of the blog, try to think how you can approach this problem?<\/p>\n Suppose our initial linked lists are \u2018a\u2019 and \u2018b\u2019, the basic idea is to take two pointers, each pointing to the head of one of the two linked list ‘a’ and ‘b’. Now start traversing the linked lists until one of them is completely traversed and while traversing check:<\/p>\n The dummy linked list which we are referring to above, it’s main idea is to take the help of a dummy node variable that will store our final resultant list (dummy LinkedList). The pointer tail will point to the last node in the resultant list, so that the new nodes can be added easily to the resultant list. This dummy node is used as a temporary node.<\/p>\n When we have traversed either of the two given lists completely, then the result is in the dummy list. The values are allocated from the next node of the dummy, i.e. our resultant intersection list starts from the next of the dummy node (dummy.next).<\/p>\n
\nLinked list 1<\/strong>:<\/p>\n![\"\"](\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/54_1-01.png\")
<\/p>\n![\"\"](\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/54_input-2-01.png\")
<\/p>\n![\"\"](\"https:\/\/prepbytes.com\/blog\/wp-content\/uploads\/2021\/08\/54_-output-01.png\")
<\/p>\n
\nNow to find the intersection of the two linked lists, we will have to find the elements which are common in both the linked list 1 and 2 i.e. element which appear in both the lists.<\/p>\n\n
\n
Approach 1 of intersection of two sorted linked lists<\/h2>\n
\n
Code Implementation of intersection of two sorted linked lists<\/h2>\n\t\t\t\t\t\t