# In-place Merge two linked lists without changing links of first list

Given two sorted singly linked lists having n and m elements each, merge them using constant space. First n smallest elements in both the lists should become part of first list and rest elements should be part of second list. Sorted order should be maintained. We are not allowed to change pointers of first linked list.

For example,

Input: First List: 2->4->7->8->10 Second List: 1->3->12 Output: First List: 1->2->3->4->7 Second List: 8->10->12

**We strongly recommend you to minimize your browser and try this yourself first.**

The problem becomes very simple if we’re allowed to change pointers of first linked list. If we are allowed to change links, we can simply do something like merge of merge-sort algorithm. We assign first n smallest elements to the first linked list where n is the number of elements in first linked list and the rest to second linked list. We can achieve this in O(m + n) time and O(1) space, but this solution violates the requirement that we can’t change links of first list.

The problem becomes a little tricky as we’re not allowed to change pointers in first linked list. The idea is something similar to this post but as we are given singly linked list, we can’t proceed backwards with the last element of LL2.

The idea is for each element of LL1, we compare it with first element of LL2. If LL1 has a greater element than first element of LL2, then we swap the two elements involved. To keep LL2 sorted, we need to place first element of LL2 at its correct position. We can find mismatch by traversing LL2 once and correcting the pointers.

Below is C++ implementation of this idea.

`// Program to merge two sorted linked lists without ` `// using any extra space and without changing links ` `// of first list ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` ` ` `/* Structure for a linked list node */` `struct` `Node ` `{ ` ` ` `int` `data; ` ` ` `struct` `Node *next; ` `}; ` ` ` `/* Given a reference (pointer to pointer) to the head ` ` ` `of a list and an int, push a new node on the front ` ` ` `of the list. */` `void` `push(` `struct` `Node** head_ref, ` `int` `new_data) ` `{ ` ` ` `/* allocate node */` ` ` `struct` `Node* new_node = ` ` ` `(` `struct` `Node*) ` `malloc` `(` `sizeof` `(` `struct` `Node)); ` ` ` ` ` `/* put in the data */` ` ` `new_node->data = new_data; ` ` ` ` ` `/* link the old list off the new node */` ` ` `new_node->next = (*head_ref); ` ` ` ` ` `/* move the head to point to the new node */` ` ` `(*head_ref) = new_node; ` `} ` ` ` `// Function to merge two sorted linked lists ` `// LL1 and LL2 without using any extra space. ` `void` `mergeLists(` `struct` `Node *a, ` `struct` `Node * &b) ` `{ ` ` ` `// run till either one of a or b runs out ` ` ` `while` `(a && b) ` ` ` `{ ` ` ` `// for each element of LL1, ` ` ` `// compare it with first element of LL2. ` ` ` `if` `(a->data > b->data) ` ` ` `{ ` ` ` `// swap the two elements involved ` ` ` `// if LL1 has a greater element ` ` ` `swap(a->data, b->data); ` ` ` ` ` `struct` `Node *temp = b; ` ` ` ` ` `// To keep LL2 sorted, place first ` ` ` `// element of LL2 at its correct place ` ` ` `if` `(b->next && b->data > b->next->data) ` ` ` `{ ` ` ` `b = b->next; ` ` ` `struct` `Node *ptr= b, *prev = NULL; ` ` ` ` ` `// find mismatch by traversing the ` ` ` `// second linked list once ` ` ` `while` `(ptr && ptr->data < temp->data) ` ` ` `{ ` ` ` `prev = ptr; ` ` ` `ptr = ptr -> next; ` ` ` `} ` ` ` ` ` `// correct the pointers ` ` ` `prev->next = temp; ` ` ` `temp->next = ptr; ` ` ` `} ` ` ` `} ` ` ` ` ` `// move LL1 pointer to next element ` ` ` `a = a->next; ` ` ` `} ` `} ` ` ` `// Code to print the linked link ` `void` `printList(` `struct` `Node *head) ` `{ ` ` ` `while` `(head) ` ` ` `{ ` ` ` `cout << head->data << ` `"->"` `; ` ` ` `head = head->next; ` ` ` `} ` ` ` `cout << ` `"NULL"` `<< endl; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `struct` `Node *a = NULL; ` ` ` `push(&a, 10); ` ` ` `push(&a, 8); ` ` ` `push(&a, 7); ` ` ` `push(&a, 4); ` ` ` `push(&a, 2); ` ` ` ` ` `struct` `Node *b = NULL; ` ` ` `push(&b, 12); ` ` ` `push(&b, 3); ` ` ` `push(&b, 1); ` ` ` ` ` `mergeLists(a, b); ` ` ` ` ` `cout << ` `"First List: "` `; ` ` ` `printList(a); ` ` ` ` ` `cout << ` `"Second List: "` `; ` ` ` `printList(b); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

Output :

First List: 1->2->3->4->7->NULL Second List: 8->10->12->NULL

Time Complexity : O(mn)

This article is contributed by **Aditya Goel**. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above

## Recommended Posts:

- Sort a linked list of 0s, 1s and 2s by changing links
- Pairwise swap elements of a given linked list by changing links
- Merge two sorted linked lists such that merged list is in reverse order
- Merge Sort for Linked Lists
- Merge K sorted linked lists | Set 1
- Merge two sorted linked lists
- Recursive selection sort for singly linked list | Swapping node links
- Merge a linked list into another linked list at alternate positions
- Merge k sorted linked lists | Set 2 (Using Min Heap)
- Merge Sort for Linked Lists in JavaScript
- Pairwise swap adjacent nodes of a linked list by changing pointers | Set 2
- Union and Intersection of two linked lists | Set-2 (Using Merge Sort)
- Construct a Maximum Sum Linked List out of two Sorted Linked Lists having some Common nodes
- Merge Sort for Doubly Linked List
- Iterative Merge Sort for Linked List