In-place Merge two linked lists without changing links of first list
Last Updated :
09 Feb, 2023
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 the implementation of this idea.
C++
// C++ 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;
}
// Java Program to merge two sorted linked lists
// without using any extra space and without
// changing links of first list
class Node {
int data;
Node next;
Node(int d)
{
data = d;
next = null;
}
}
class LinkedList {
Node head;
// 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(int new_data)
{
/* allocate node */
Node new_node = new Node(new_data);
/* link the old list off the new node */
new_node.next = head;
/* move the head to point to the new node */
head = new_node;
}
// Function to merge two sorted linked lists
// LL1 and LL2 without using any extra space.
void mergeLists(Node a, Node b)
{
// run till either one of a or b runs out
while (a != null && b != null) {
// 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
int temp = a.data;
a.data = b.data;
b.data = temp;
Node temp2 = b;
// To keep LL2 sorted, place first
// element of LL2 at its correct place
if (b.next != null
&& b.data > b.next.data) {
b = b.next;
Node ptr = b;
Node prev = null;
// find mismatch by traversing the
// second linked list once
while (ptr != null
&& ptr.data < temp2.data) {
prev = ptr;
ptr = ptr.next;
}
// correct the pointers
prev.next = temp2;
temp2.next = ptr;
}
}
// move LL1 pointer to next element
a = a.next;
}
}
// Code to print the linked link
void printList(Node head)
{
while (head != null) {
System.out.print(head.data + "->");
head = head.next;
}
System.out.println("NULL");
}
// Driver code
public static void main(String args[])
{
LinkedList list1 = new LinkedList();
list1.push(10);
list1.push(8);
list1.push(7);
list1.push(4);
list1.push(2);
LinkedList list2 = new LinkedList();
list2.push(12);
list2.push(3);
list2.push(1);
list1.mergeLists(list1.head, list2.head);
System.out.println("First List: ");
list1.printList(list1.head);
System.out.println("Second List: ");
list2.printList(list2.head);
}
}
# Python3 program to merge two sorted linked
# lists without using any extra space and
# without changing links of first list
# Structure for a linked list node
class Node:
def __init__(self):
self.data = 0
self.next = None
# 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.
def push(head_ref, new_data):
# Allocate node
new_node = 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
return head_ref
# Function to merge two sorted linked lists
# LL1 and LL2 without using any extra space.
def mergeLists(a, b):
# Run till either one of a
# or b runs out
while (a and 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
a.data, b.data = b.data, a.data
temp = b
# To keep LL2 sorted, place first
# element of LL2 at its correct place
if (b.next and b.data > b.next.data):
b = b.next
ptr = b
prev = None
# Find mismatch by traversing the
# second linked list once
while (ptr and 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
# Function to print the linked link
def printList(head):
while (head):
print(head.data, end = '->')
head = head.next
print('NULL')
# Driver code
if __name__=='__main__':
a = None
a = push(a, 10)
a = push(a, 8)
a = push(a, 7)
a = push(a, 4)
a = push(a, 2)
b = None
b = push(b, 12)
b = push(b, 3)
b = push(b, 1)
mergeLists(a, b)
print("First List: ", end = '')
printList(a)
print("Second List: ", end = '')
printList(b)
# This code is contributed by rutvik_56
// C# Program to merge two sorted linked lists without
// using any extra space and without changing links
// of first list
using System;
public class Node{
public int data;
public Node next;
public Node(int item){
data = item;
next = null;
}
}
class GFG{
// 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.
public static Node push(Node head_ref, int new_data){
// allocate node and put in the data
Node new_node = new Node(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;
return head_ref;
}
// Function to merge two sorted linked lists
// LL1 and LL2 without using any extra space.
public static void mergeLists(Node a, Node b){
// run till either one of a or b runs out
while(a != null && b != null){
// 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
int tp = a.data;
a.data = b.data;
b.data = tp;
Node temp = b;
// To keep LL2 sorted, place first
// element of LL2 at its correct place
if(b.next != null && b.data > b.next.data){
b = b.next;
Node ptr = b;
Node prev = null;
// find mismatch by traversing the
// second linked list once
while(ptr != null && ptr.data < temp.data){
prev = ptr;
ptr = ptr.next;
}
// corrent the pointers
prev.next = temp;
temp.next = ptr;
}
}
// move LL1 pointer to next element
a = a.next;
}
}
// Code to print the linked link
public static void printList(Node head)
{
while(head != null){
Console.Write(head.data + "->");
head = head.next;
}
Console.WriteLine("NULL");
}
public static void Main(string[] args){
Node a = null;
a = push(a, 10);
a = push(a, 8);
a = push(a, 7);
a = push(a, 4);
a = push(a, 2);
Node b = null;
b = push(b, 12);
b = push(b, 3);
b = push(b, 1);
mergeLists(a, b);
Console.WriteLine("First List: ");
printList(a);
Console.WriteLine("");
Console.WriteLine("Second List: ");
printList(b);
}
}
// THIS CODE IS CONTRIBUTED BY KIRTI AGARWAL(KIRTIAGARWAL23121999)
// JavaScript Program to merge two sorted linked lists without
// using any extra space and without changing links
// of first list
// Structure for a linked list node
class Node{
constructor(data){
this.data = data;
this.next = null;
}
}
// 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.
function push(head_ref, new_data)
{
// allocate node and put in the data
let new_node = new Node(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;
return head_ref;
}
// Function to merge two sorted linked lists
// LL1 and LL2 without using any extra space.
function mergeLists(a, b)
{
// run till either one of a or b runs out
while(a != null && b != null)
{
// 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
[a.data, b.data] = [b.data, a.data];
let temp = b;
// To keep LL2 sorted, place first
// element of LL2 at its correct place
if(b.next != null && b.data > b.next.data){
b = b.next;
let ptr = b;
let prev = null;
// find mismatch by traversing the
// second linked list once
while(ptr != null && ptr.data < temp.data){
prev = ptr;
ptr = ptr.next;
}
// corrent the pointers
prev.next = temp;
temp.next = ptr;
}
}
// move LL1 pointer to next element
a = a.next;
}
}
// Code to print the linked link
function printList(head)
{
while(head != null)
{
console.log(head.data + "->");
head = head.next;
}
console.log("NULL");
}
// Driver Code
let a = null;
a = push(a, 10);
a = push(a, 8);
a = push(a, 7);
a = push(a, 4);
a = push(a, 2);
let b = null;
b = push(b, 12)
b = push(b, 3)
b = push(b, 1)
mergeLists(a, b);
console.log("First List: ");
printList(a);
console.log("<br>");
console.log("Second List: ");
printList(b);
// This code is contributed by Yash Agarwal(yashagarwal2852002)
OutputFirst List: 1->2->3->4->7->NULL
Second List: 8->10->12->NULL
Time Complexity : O(mn)
Auxiliary Space: O(1)
Similar Reads
Merge two sorted linked list without duplicates
Merge two sorted linked list of size n1 and n2. The duplicates in two linked list should be present only once in the final sorted linked list. Examples: Input : list1: 1->1->4->5->7 list2: 2->4->7->9Output : 1 2 4 5 7 9Source: Microsoft on Campus Placement and Interview Question
15+ min read
Merge a linked list into another linked list at alternate positions
Given two singly linked lists, The task is to insert nodes of the second list into the first list at alternate positions of the first list and leave the remaining nodes of the second list if it is longer.Example:Input: head1: 1->2->3 , head2: 4->5->6->7->8Output: head1: 1->4-
8 min read
Find intersection point of two Linked Lists without finding the length
There are two singly linked lists in a system. By some programming error, the end node of one of the linked lists got linked to the second list, forming an inverted Y shaped list. Write a program to get the point where both the linked lists merge. Examples: Input: 1 -> 2 -> 3 -> 4 -> 5 -
7 min read
Union and Intersection of two Linked List using Merge Sort
Given two singly Linked Lists, create union and intersection lists that contain the union and intersection of the elements present in the given lists. Each of the two lists contains distinct node values.Note: The order of elements in output lists doesn't matter.Examples:Input: head1: 10 -> 15 -
15+ min read
Pairwise Swap Nodes of a given linked list by changing links
Given a singly linked list, write a function to swap elements pairwise. For example, if the linked list is 1->2->3->4->5->6->7 then the function should change it to 2->1->4->3->6->5->7, and if the linked list is 1->2->3->4->5->6 then the function sh
15+ min read
Merge two unsorted linked lists to get a sorted list - Set 2
Given two unsorted Linked Lists, L1 of N nodes and L2 of M nodes, the task is to merge them to get a sorted singly linked list. Examples: Input: L1 = 3?5?1, L2 = 6?2?4?9Output: 1?2?3?4?5?6?9 Input: L1 = 1?5?2, L2 = 3?7Output: 1?2?3?5?7 Note: A Memory Efficient approach that solves this problem in O(
15+ min read
Create new linked list from two given linked list with greater element at each node
Given two linked list of the same size, the task is to create a new linked list using those linked lists. The condition is that the greater node among both linked list will be added to the new linked list.Examples: Input: list1 = 5->2->3->8list2 = 1->7->4->5Output: New list = 5-
8 min read
Count occurrences of one linked list in another Linked List
Given two linked lists head1 and head2, the task is to find occurrences of head2 in head1. Examples: Input: Head1 = 1->2->3->2->4->5->2->4, Head2 = 2->4Output: Occurrences of head2 in head1: 2 Input: Head1 = 3->4->1->5->2, Head2 = 3->4Output: Occurrences of Hea
15 min read
Union and Intersection of two Linked Lists
Given two singly Linked Lists, create union and intersection lists that contain the union and intersection of the elements present in the given lists. Each of the two linked lists contains distinct node values.Note: The order of elements in output lists doesn’t matter. Example:Input: head1: 10 ->
15+ min read
Add two numbers represented by Linked List without any extra space
Given two numbers represented by two linked lists, write a function that returns sum list. The sum list is linked list representation of addition of two input numbers. Expected Space Complexity O(1). Examples: Input: L1 = 5 -> 6 -> 3 -> NULL L2 = 8 -> 4 -> 2 -> NULL Output: 1 ->
11 min read