Question

Input the data for node 1 1 Enter more yes/Kno ? n Display Insert First Insert Last Insert Anywhere Delete First Delete Last Delete Anyone Search Exit Enter your Choice 1 1) 2> 3> 4X 5> 6) 7> 8) Data at 1 1 - Instructions: 1. Write a program to manage following operations Dynamic link list using C language: on a Display List a. Make sure to declare Link List Start pointer inside the main function and pass the same to various user-defined functions to perform the required operation. b. Insert at First Location Insert at Last Location C. d. Insert at Given Location e. Delete from First Location Assignments using any global variable or without user- f. Delete from Last Location defined functions would not be evaluated. Delete from Given g. Location h. Search (based data) on i. Exit 2. Write appropriate comments in the program

Answer 1

Code in C language:

#include <stdio.h>
#include<malloc.h>
struct node
{
int value;
struct node *next;
};
typedef struct node Node;

Node* insertBegin(Node* head,int n)
{  
   struct node *newnode=(struct node*)malloc(sizeof(struct node));
   newnode->value=n;
   newnode->next=head;
   head=newnode;
   return head;
}
Node* inserAtLocation(Node *head, int n, int pos)
{
if(pos == 1){           //if the inserted position is 1
return (insertBegin(head,n));
}
   int count=1;
   struct node *newnode=(struct node*)malloc(sizeof(struct node));
   newnode->value=n;
   newnode->next=NULL;
   if(!head){
head = newnode;
return head;
}
  
   struct node *temp=head;
   while(count != pos-1)           //go to position's previous element
   {
       temp=temp->next;
       count++;
   }
   newnode->next=temp->next;
   temp->next=newnode;
  
   return head;
}
Node* insertEnd(Node* head, int n){
Node* temp = head;

struct node *newnode=(struct node*)malloc(sizeof(struct node));
newnode->value = n;
newnode->next = NULL;
if(!head){           //if no data is present in list, insert at begin
head = newnode;
return head;
}
while(temp->next){           //else go to last node
temp = temp->next;
}
temp->next = newnode;
return head;
}

Node* delAtLoc(Node* head,int pos)
{                       //if no head
   if(head==NULL)
       return head;
   if(head->next==NULL)
   {                   //if only one node is present
       free(head);
       head=NULL;
       return head;
   }
   int count=1;
   Node* temp=head;
   while(count!=pos-1)
   {
       temp=temp->next;
   }
   struct node *t=temp->next;
   temp->next=temp->next->next;
   free(t);
   return head;
}

Node *delBegin(Node *head)
{
   if(head==NULL)
       return head;   //if no head
   if(head->next==NULL)
   {                   //if only one element present
       free(head);
       head=NULL;
       return head;
   }
   Node* temp=head;
   head=head->next;
   free(temp);
   return head;
}

Node *delEnd(Node *head)
{
   if(head==NULL)       //if no data
       return head;
   if(head->next==NULL)
   {                       //if only one element present
       free(head);
       head=NULL;
       return head;
   }
   Node* temp=head;
   while(temp->next->next)
       temp=temp->next;
   struct node *t=temp->next;
   temp->next=NULL;
   free(t);
   return head;
}
printList(Node* head){
if(!head){           //no data to print condition
printf("No data to print\n");
}
while(head){
printf("%d ",head->value);
head = head->next;
}
printf("\n");
}
searchNode(Node* head,int val){
int flag = 0;
while(head){
if(head->value == val){       //condition checking if present
flag = 1;
break;
}
head = head->next;
}
if(flag == 1)
printf("Value found in the linked list\n");
else
printf("Value not found in the linked list\n");
}
int main ()
{
int loc,data;
Node* start = NULL;
char opt;
do{
   printf("=================================\n");
printf("a. Display\n");
printf("b. Insert at First Location\n");
printf("c. Insert at Last Location\n");
printf("d. Insert at Given Location\n");
printf("e. Delete from First Location\n");
printf("f. Delete from Last Location\n");
printf("g. Delete from Given Location\n");
printf("h. Search (based on data)\n");
printf("i. Exit\n");
printf("Enter Option to Select: ");
scanf("\n%c",&opt);
switch(opt){
case 'a':
printf("Printing the list: \n");
printList(start);
break;
case 'b':
printf("Enter data to insert: ");
scanf("%d",&data);
start = insertBegin(start,data);
break;
case 'c':
printf("Enter data to insert: ");
scanf("%d",&data);
start = insertEnd(start,data);
break;
case 'd':
printf("Enter data to insert: ");
scanf("%d",&data);
printf("Enter the Location to insert: ");
scanf("%d",&loc);
start = inserAtLocation(start,data,loc);
break;
case 'e':
start = delBegin(start);
break;
case 'f':
start = delEnd(start);
break;
case 'g':
printf("Enter the Location to delete: ");
scanf("%d",&loc);
start = delAtLoc(start,loc);
break;
case 'h':
printf("Enter data to search: ");
scanf("%d",&data);
searchNode(start,data);
break;
}
  
} while(opt != 'i');
return 0;
}

Output:

a. Display b. Insert at First Location c. Insert at Last Location d. Insert at Given Location e. Delete from First Location f. Delete from Last Location g. Delete from Given Location h. Search (based on data) i. Exit Enter Option to Select: b Enter data to insert: 3 a. Display b. Insert at First Location c. Insert at Last Location d. Insert at Given Location e. Delete from First Location f. Delete from Last Location g. Delete from Given Location h. Search (based on data) i. Exit Enter Option to Select: c Enter data to insert: 6 a. Display b. Insert at First Location c. Insert at Last Location d. Insert at Given Location e. Delete from First Location f. Delete from Last Location g. Delete from Given Location h. Search (based on data) i. Exit Enter Option to Select: a Printing the list: 3 6