-
Notifications
You must be signed in to change notification settings - Fork 88
/
queuelinked.c
127 lines (119 loc) · 1.71 KB
/
queuelinked.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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
// program to do queue using linked list
//contributed by afeef thameem
//date modified 1/11/21
#include <stdio.h>
#include <stdlib.h>
struct node
{
int data;
struct node *next;
}*front,*rear,*temp;
void enqueue();
void dequeue();
void display();
int main()
{
int choice;
while(1)
{
printf("\n1.Enqueue \n2.Dequeue \n3.Display \n4.End\n");
scanf("%d",&choice);
switch (choice)
{
case 1:{
enqueue();
break;
}
case 2:{
dequeue();
break;
}
case 3:{
display();
break;
}
case 4:{
exit(0);
}
}
}
}
void enqueue()
{
temp=(struct node *)malloc (sizeof (struct node));
printf("Enter data:");
scanf("%d",&temp->data);
temp->next=NULL;
if (front==NULL)
{
front=temp;
rear=temp;
}
else
{
front->next=temp;
front=front->next;
}
}
void dequeue()
{
if(rear==NULL)
{
printf("queue is underflow \n");
}
else
{
printf(" dequeued element =%d\n",rear->data);
rear=rear->next;
}
}
void display()
{
temp=rear;
printf("Queue :\n");
while(temp!=NULL)
{
printf("%d\n",temp->data);
temp=temp->next;
}
}
/*
output:
1.Enqueue
2.Dequeue
3.Display
4.End
1
Enter data:5
1.Enqueue
2.Dequeue
3.Display
4.End
1
Enter data:4
1.Enqueue
2.Dequeue
3.Display
4.End
3
Queue :
5
4
1.Enqueue
2.Dequeue
3.Display
4.End
2
dequeued element =5
1.Enqueue
2.Dequeue
3.Display
4.End
Queue :
4
1.Enqueue
2.Dequeue
3.Display
4.End
4
*/