-
Notifications
You must be signed in to change notification settings - Fork 7
/
queuell.c
85 lines (80 loc) · 1.16 KB
/
queuell.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
int info;
struct node *link;
}node;
node *front=NULL;
node *rear=NULL;
void enqueue()
{
node *ptr;
ptr=(node*)malloc(sizeof(node));
int x;
printf("enter the element\n");
scanf("%d",&x);
ptr->info=x;
if((front==NULL)&&(rear==NULL))
{
front=ptr;
rear=ptr;
rear->link=NULL;
}
else
{
rear->link=ptr;
ptr->link=NULL;
rear=ptr;
}
}
void dequeue()
{
if((front==NULL)&&(rear==NULL))
printf("--QUEUE UNDERFLOW--\n");
else if(front==rear)
{
front=NULL;
rear=NULL;
}
else
{
front=front->link;
}
}
void printqueue()
{
if((front==NULL)&&(rear==NULL))
return;
else
{
node *ptr;
for(ptr=front;ptr!=NULL;ptr=ptr->link)
printf("%d ",ptr->info);
}
}
int main()
{
int ch=-1;
while(ch!=0)
{
printf(" ==Queue Using Array==\n");
printf("Exit=0\n");
printf("Enqueue=1\n");
printf("Dequeue=2\n");
printf("Queue Output=3\n");
printf("Enter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 0: exit(0);
case 1: enqueue();
break;
case 2: dequeue();
break;
case 3: printqueue();
break;
default: printf("--Invalid Choice--\n");
}
}
}