Question

Write a program to add data anywhere of the LinkedList. Use switch case to do the program. If possible, use while (1) to continue the loop. So, the user can continue to insert data as well as show data without quilting from the program. The user will get the following options to choose from.1.Insert data at the beginning 2.Insert data in the middle 3. Insert data at the end 4. Show data 5.Quit

It's a C program. And how to show data?

Answer 1

Hi i have solved your problem hope this will be helpful to you kindly give a thumbs up if you like it and if you have any doubt regarding the code please do comment.

code:-

#include<stdio.h>
#include<conio.h>

struct node
{
int data;
struct node *next;
}*start=NULL,*q,*t;

int main()
{
int Choice;
void Insert_Begning();
void Insert_End();
int Insert_Position();
void Display_List();
void Delete_Begning();
void Delete_End();
int Delete_Position();

while(1)
{
printf("\n\n---- Singly Linked List ---- \n\n");
printf("\n1.Insert into List \n2.Display the List \n3.Delete From List \n4.Exit from the Program \n\n");
printf("Enter your choice between (1-4):");
scanf("%d",&Choice);

switch(Choice)
{
case 1:
printf("\n---- Please Select the Proper option ----");
printf("\n1.Insert at beginning\n2.Insert at end\n3.Insert at specified position\n4.Exit");
printf("\n\nEnter your choice(1-4):");
scanf("%d",&Choice);

switch(Choice)
{
case 1: Insert_Begning();
break;
case 2: Insert_End();
break;
case 3: Insert_Position();
break;
case 4: exit(0);
default: printf("Wrong Choice!!");
}
break;

case 2: Display_List();
break;

case 3: printf("\n---- Delete Menu ----");
printf("\n1.Delete from beginning\n2.Delete from end\n3.Delete from specified position\n4.Exit");
printf("\n\nEnter your choice(1-4):");
scanf("%d",&Choice);

switch(Choice)
{
case 1: Delete_Begning();
break;
case 2: Delete_End();
break;
case 3: Delete_Position();
break;
case 4: exit(0);
default: printf("Wrong Choice!!");
}
break;
case 4: exit(0);
default: printf("Wrong Choice!!");
}
}
return 0;
}

void Insert_Begning() //Function to insert at Begning
{
int Number;
t=(struct node*)malloc(sizeof(struct node));
printf("Enter data:");
scanf("%d",&Number);
t->data=Number;

if(start==NULL) //Check if the list is empty
{
t->next=NULL;
start=t;
}
else
{
t->next=start;
start=t;
}
}

void Insert_End() //Function to insert at End
{
int Number;
t=(struct node*)malloc(sizeof(struct node));
printf("Enter data:");
scanf("%d",&Number);
t->data=Number;
t->next=NULL;

if(start==NULL) //Check If the list is empty
{
start=t;
}
else
{
q=start;
while(q->next!=NULL)
q=q->next;
q->next=t;
}
}
  
int Insert_Position() //Function to insert at specified position
{
int pos,i,Number;
if(start==NULL)
{
printf("List has no element !!");
return 0;
}

t=(struct node*)malloc(sizeof(struct node));
printf("Enter data:");
scanf("%d",&Number);
printf("Enter position to insert:");
scanf("%d",&pos);
t->data=Number;

q=start;
for(i=1;i<pos-1;i++)
{
if(q->next==NULL)
{
printf("There are less elements!!");
return 0;
}

q=q->next;
}

t->next=q->next;
q->next=t;
return 0;
}

void Display_List() //Function to Display the list
{
if(start==NULL)
{
printf("List has no element !!");
}
else
{
q=start;
printf("The linked list is:\n");
while(q!=NULL)
{
printf("%d->",q->data);
q=q->next;
}
}
}

void Delete_Begning() //Function to delete from Begning
{
if(start==NULL)
{
printf("The list is empty!!");
}
else
{
q=start;
start=start->next;
printf("Deleted element is %d",q->data);
free(q);
}
}

void Delete_End() //Function to delete from End
{
if(start==NULL)
{
printf("The list is empty!!");
}
else
{
q=start;
while(q->next->next!=NULL)
q=q->next;

t=q->next;
q->next=NULL;
printf("Deleted element is %d",t->data);
free(t);
}
}

int Delete_Position() //Function to delete from Specified Position
{
int pos,i;

if(start==NULL)
{
printf("List is empty!!");
return 0;
}

printf("Enter position to delete:");
scanf("%d",&pos);

q=start;
for(i=1;i<pos-1;i++)
{
if(q->next==NULL)
{
printf("There are less elements!!");
return 0;
}
q=q->next;
}

t=q->next;
q->next=t->next;
printf("Deleted element is %d",t->data);
free(t);

return 0;
}

output:-

Happy to help :)