Modify the given code to store strings in the stack. Please do the needed changes on the given code and don't change the main structure of the stack. #include #include struct node { int data; struct node link; }front, rear; void insert(); // Function used to insert the element into the queue void delet(); // Function used to delete the elememt from the queue void display(); // Function used to display all the elements in the queue according to FIFO rule int main() { printf("Welcome to DataFlair tutorials!\n\n"); int choice; printf ("LINKED LIST IMPLEMENTATION OF QUEUES\n\n"); do { printf("1. Insert\n2. Delete\n3. Display\n4. Exit\n\n"); printf("Enter your choice:"); scanf("%d",&choice); switch(choice) { case 1: insert(); break; case 2: delet(); break; case 3: display(); break; case 4: exit(0); break; default: printf("Sorry, invalid choice!\n"); break; } } while(choice!=4); return 0; } void insert() { struct node temp; temp = (struct node)malloc(sizeof(struct node)); printf("Enter the element to be inserted in the queue: "); scanf("%d", &temp->data); temp->link = NULL; if (rear == NULL) { front = rear = temp; } else { rear->link = temp; rear = temp; } } void delet() { struct node temp; temp = front; if (front == NULL) { printf("Queue underflow\n"); front = rear = NULL; } else { printf("The deleted element from the queue is: %d\n", front->data); front = front->link; free(temp); } } void display() { struct node *temp; temp = front; int cnt = 0; if (front == NULL) { printf("Queue underflow\n"); } else { printf("The elements of the stack are:\n"); while (temp) { printf("%d\n", temp->data); temp = temp->link; cnt++; } }

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

100%

Modify the given code to store strings in the stack. Please do the needed changes on the given code and don't change the main structure of the stack.

#include <stdio.h>
#include <stdlib.h>
struct node
{
int data;
struct node *link;
}*front, *rear;
void insert(); // Function used to insert the element into the queue
void delet(); // Function used to delete the elememt from the queue
void display(); // Function used to display all the elements in the queue according to FIFO rule
int main()
{
printf("Welcome to DataFlair tutorials!\n\n");
int choice;
printf ("LINKED LIST IMPLEMENTATION OF QUEUES\n\n");
do
{
printf("1. Insert\n2. Delete\n3. Display\n4. Exit\n\n");
printf("Enter your choice:");
scanf("%d",&choice);
switch(choice)
{
case 1:
insert();
break;
case 2:
delet();
break;
case 3:
display();
break;
case 4:
exit(0);
break;
default:
printf("Sorry, invalid choice!\n");
break;
}
} while(choice!=4);
return 0;
}
void insert()
{
struct node *temp;
temp = (struct node*)malloc(sizeof(struct node));
printf("Enter the element to be inserted in the queue: ");
scanf("%d", &temp->data);
temp->link = NULL;
if (rear == NULL)
{
front = rear = temp;
}
else
{
rear->link = temp;
rear = temp;
}
}
void delet()
{
struct node *temp;
temp = front;
if (front == NULL)
{
printf("Queue underflow\n");
front = rear = NULL;
}
else
{
printf("The deleted element from the queue is: %d\n", front->data);
front = front->link;
free(temp);
}
}
void display()
{
struct node *temp;
temp = front;
int cnt = 0;
if (front == NULL)
{
printf("Queue underflow\n");
}
else
{
printf("The elements of the stack are:\n");
while (temp)
{
printf("%d\n", temp->data);
temp = temp->link;
cnt++;
}
}
}