-
Notifications
You must be signed in to change notification settings - Fork 2
/
circular_linked_queue.c
107 lines (85 loc) · 1.7 KB
/
circular_linked_queue.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
#include<stdio.h>
#include <stdlib.h>
struct Node {
int data;
struct Node *next;
}*front, *rear;
typedef struct Node node;
int isEmpty() {
return (rear == NULL && front == NULL);
}
void enqueue(int item) {
node *newNode = (struct Node*)malloc(sizeof(struct Node*));
newNode -> data = item;
newNode -> next = front;
if(rear == NULL) {
front = rear = newNode;
}
else {
rear -> next = newNode;
rear = newNode;
}
}
void dequeue() {
if(isEmpty()) printf("Queue is Underflow!\n");
else if(rear == front) {
node *temp = front;
front = rear = NULL;
printf("Dequeued : %d\n", temp->data);
free(temp);
}
else {
node *temp = front;
front = front -> next;
rear -> next = front;
printf("Dequeued : %d\n", temp->data);
free(temp);
}
}
void display() {
if(isEmpty()) printf("Nothing to print! List is Underflow!\n");
else {
printf("Queue is : ");
node *temp;
temp = front;
while(temp -> next != front) {
printf("%d ", temp -> data);
temp = temp -> next;
}
printf("%d", temp->data);
printf("\n");
}
}
int main() {
enqueue(1);
enqueue(2);
enqueue(3);
enqueue(4);
enqueue(5);
display();
dequeue();
display();
dequeue();
dequeue();
dequeue();
display();
dequeue();
display();
enqueue(5);
enqueue(6);
display();
return 0;
}
/*
Output:
Queue is : 1 2 3 4 5
Dequeued : 1
Queue is : 2 3 4 5
Dequeued : 2
Dequeued : 3
Dequeued : 4
Queue is : 5
Dequeued : 5
Nothing to print! List is Underflow!
Queue is : 5 6
*/