onvert the given code to stack instead of queue: Note: I already uploaded this question and I resieved a wrong answer. Please don't rush while solving the question. #include #include struct node { char data[100]
Convert the given code to stack instead of queue:
Note: I already uploaded this question and I resieved a wrong answer. Please don't rush while solving the question.
#include <stdio.h>
#include <stdlib.h>
struct node
{
char data[100];
struct node *link;
}*front, *rear;
struct node *list=NULL;
void insert()
{
struct node *temp;
temp = (struct node*)malloc(sizeof(struct node));
printf("Enter the element to be inserted in the queue: ");
scanf("%s",temp->data);
temp->link = NULL;
if (rear == NULL)
{
front = rear = temp;
}
else
{
rear->link = temp;
rear = 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("%s\n", temp->data);
temp = temp->link;
cnt++;
}
}
}
void undo()
{
struct node *temp=front;
if(front == NULL)
printf("\nNO element to Undo.\n");
else
{
while(temp->link->link)
{
temp=temp->link;
}
if(list==NULL)
{ list=temp->link;
temp->link=NULL;
}
else
{
temp->link->link=list;
list=temp->link;
temp->link=NULL;
}
}
}
void redo()
{
struct node *temp=front;
if(list == NULL)
printf("\nNO element to Redo.\n");
else
{
while(temp->link)
{
temp=temp->link;
}
temp->link=list;
list=list->link;
temp->link->link=NULL;
}
}
int main()
{
printf("Welcome to DataFlair tutorials!\n\n");
int choice;
printf ("LINKED LIST IMPLEMENTATION OF QUEUES\n\n");
do
{
printf("1. Insert \n2. Display\n3. Undo \n4. Redo \n5. Exit\n\n");
printf("Enter your choice:");
scanf("%d",&choice);
switch(choice)
{
case 1:
insert();
break;
case 2:
display();
break;
case 3:
undo();
break;
case 4:
redo();
break;
case 5:
exit(0);
break;
default:
printf("Sorry, invalid choice!\n");
break;
}
} while(choice!=5);
return 0;
}
Step by step
Solved in 2 steps
