Assignment 10
Assignment 10
h>
#include<stdlib.h>
struct queue
int data;
void enqueue();
void dequeue();
void display();
int main()
int ch;
front = NULL;
rear = NULL;
do{
printf("\n1.Enqueue\n2.Dequeue\n");
scanf("%d",&ch);
switch(ch)
case 1:
enqueue();
display();
break;
case 2:
dequeue();
display();
break;
default:
printf("Invalid");
}while(ch<3);
void enqueue()
scanf("%d",&p->data);
p->next = NULL;
if(rear == NULL)
rear = p;
front = p;
else
rear->next = p;
rear = rear->next;
void dequeue()
q = front ;
if(q == NULL)
{
printf("It is Empty!!\n");
else
free(q);
void display()
q = front;
while(q != NULL)
printf("%d\t",q->data);
q = q->next;
OUTPUT:
1.Enqueue
2.Dequeue
1
Enter the element you want to add
1.Enqueue
2.Dequeue
2 3
1.Enqueue
2.Dequeue
2 3 4
1.Enqueue
2.Dequeue
2 3 4 5
1.Enqueue
2.Dequeue
1
Enter the element you want to add
2 3 4 5 6
1.Enqueue
2.Dequeue
1.Enqueue
2.Dequeue
1.Enqueue
2.Dequeue
Invalid