Skip to content
Related Articles

Related Articles

Improve Article

C program to create copy of a singly Linked List using Recursion

  • Last Updated : 20 Oct, 2020

Given a pointer to the head node of a Linked List, the task is to create a copy of the linked list using recursion.

Examples::

Input: Head of following linked list
1->2->3->4->NULL
Output
Original list: 1 -> 2 -> 3 -> 4 -> NULL
Duplicate list: 1 -> 2 -> 3 -> 4 -> NULL

Input: Head of following linked list
1->2->3->4->5->NULL
Output
Original list: 1->2->3->4->5->NULL,
Duplicate list: 1->2->3->4->5->NULL,

Approach: Follow the steps below to solve the problem:

  1. Base case: if (head == NULL), then return NULL.
  2. Allocate the new Node in the Heap using malloc() & set its data.
  3. Recursively set the next pointer of the new Node by recurring for the remaining nodes.
  4. Return the head pointer of the duplicate node.
  5. Finally, print both the original linked list and the duplicate linked list.

Below is the implementation of the above approach:



C




// C program for the above approach
#include <stdio.h>
#include <stdlib.h>
  
// Node for linked list
struct Node {
    int data;
    struct Node* next;
};
  
// Function to print given linked list
void printList(struct Node* head)
{
    struct Node* ptr = head;
    while (ptr) {
  
        printf("%d -> ", ptr->data);
        ptr = ptr->next;
    }
  
    printf("NULL");
}
  
// Function to create a new node
void insert(struct Node** head_ref, int data)
{
    // Allocate the memory for new Node
    // in the heap and set its data
    struct Node* newNode
        = (struct Node*)malloc(
            sizeof(struct Node));
  
    newNode->data = data;
  
    // Set the next node pointer of the
    // new Node to point to the current
    // node of the list
    newNode->next = *head_ref;
  
    // Change the pointer of head to point
    // to the new Node
    *head_ref = newNode;
}
  
// Function to create a copy of a linked list
struct Node* copyList(struct Node* head)
{
    if (head == NULL) {
        return NULL;
    }
    else {
  
        // Allocate the memory for new Node
        // in the heap and set its data
        struct Node* newNode
            = (struct Node*)malloc(
                sizeof(struct Node));
  
        newNode->data = head->data;
  
        // Recursively set the next pointer of
        // the new Node by recurring for the
        // remaining nodes
        newNode->next = copyList(head->next);
  
        return newNode;
    }
}
  
// Function to create the new linked list
struct Node* create(int arr[], int N)
{
    // Pointer to point the head node
    // of the singly linked list
    struct Node* head_ref = NULL;
  
    // Construct the linked list
    for (int i = N - 1; i >= 0; i--) {
  
        insert(&head_ref, arr[i]);
    }
  
    // Return the head pointer
    return head_ref;
}
  
// Function to create both the lists
void printLists(struct Node* head_ref,
                struct Node* dup)
{
  
    printf("Original list: ");
  
    // Print the original linked list
    printList(head_ref);
  
    printf("\nDuplicate list: ");
  
    // Print the duplicate linked list
    printList(dup);
}
  
// Driver Code
int main(void)
{
    // Given nodes value
    int arr[] = { 1, 2, 3, 4, 5 };
    int N = sizeof(arr) / sizeof(arr[0]);
  
    // Head of the original Linked list
    struct Node* head_ref = create(arr, N);
  
    // Head of the duplicate Linked List
    struct Node* dup = copyList(head_ref);
  
    printLists(head_ref, dup);
  
    return 0;
}


Output:

Original list: 1 -> 2 -> 3 -> 4 -> 5 -> NULL
Duplicate list: 1 -> 2 -> 3 -> 4 -> 5 -> NULL

Time Complexity: O(N)
Auxiliary Space: O(N)

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.




My Personal Notes arrow_drop_up
Recommended Articles
Page :