Question

Write a function with the following prototype struct node* copyList(struct node* 1ist) The struct node is the same used in question 18. The function should create a new, separate copy of the linked list pointed to by the list parameter and return a pointer to the head of the newly created linked list copy.

Answer 1

#include<conio.h>

#include<stdio.h>

#include<malloc.h>

struct node // structure

{

int data;

struct node *next;

};

void Display(struct node *n) // Function to display the link list

{

while (n != NULL)

{

printf(" %d ", n->data);

n = n->next;

}

}

void Push_Tail(struct node** head_ref, int new_data) // Function to add a node at the end of the link list

{

struct node* new_node = (struct node*) malloc(sizeof(struct node));

struct node *last = *head_ref;

new_node->data = new_data;   

new_node->next = NULL;

if (*head_ref == NULL)

{

*head_ref = new_node;

return;

}

  

while (last->next != NULL)

last = last->next;

  

last->next = new_node;

  

return;

}

struct node* copyList(struct node *n) // Copy List Function

{

struct node* temp = NULL; // Used for temporary node creation

struct node* prev = NULL; // Using this variable to keep a track of the previous node

struct node* head = NULL; // return this head pointer

int i=0;

while (n != NULL)

{

temp = (struct node*)malloc(sizeof(struct node)); // Create a temporary node

temp->data =n->data;

temp->next = NULL;

if(i==0) // Point head to the first node

head=temp;

if(prev!=NULL) // Link the previous node to the next node

prev->next=temp;

prev=temp; // Keep track of the previous node

n = n->next; // Look for the next node

i++; // i is used just to copy the address of the 1st node to head

}

return head; // return the head node

}

int main()

{

struct node* head;

struct node* list;

Push_Tail(&head,10);

Push_Tail(&head,23);

Push_Tail(&head,35);

Push_Tail(&head,47);

Push_Tail(&head,59); // List is 10->23->35->47->59

printf("\nORIGNAL LIST\n");

Display(head);

printf("\nCOPY LIST\n");

list=copyList(head);

Display(list);

getch();

return 0;

}

OUTPUT