-
Notifications
You must be signed in to change notification settings - Fork 0
/
deque.c
125 lines (110 loc) · 1.67 KB
/
deque.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
#include <stdio.h>
#include <stdlib.h>
struct link
{
int data;
struct link *next;
};
typedef struct link *node;
typedef struct
{
node rear, front;
}QUEUE;
int isEmpty(QUEUE *q)
{
if(q->front == NULL && q->rear==NULL)
return 1;
else
return 0;
}
void enqueueR(QUEUE *q, int el)
{
node ptr= (node)malloc(sizeof(struct link));
ptr->data = el;
ptr->next = NULL;
if(q->front == NULL && q->rear==NULL)
{
q->front = ptr;
q->rear = ptr;
}
else
{
(q->rear)->next = ptr;
q->rear = ptr;
}
}
void enqueueF(QUEUE *q, int el)
{
node ptr= (node)malloc(sizeof(struct link));
ptr->data = el;
if(q->front == NULL && q->rear==NULL)
{
q->front = ptr;
q->rear = ptr;
ptr->next = NULL;
}
else
{
ptr->next = q->front;
q->front = ptr;
}
}
void dequeueR(QUEUE *q)
{
if(isEmpty(q))
{
printf("\nQueue is empty!!\n");
return;
}
node ptr = (node)malloc(sizeof(struct link));
ptr = q->front;
printf("\nElement dequeued - %d\n", q->rear->data);
while(ptr->next!=q->rear)
{
ptr = ptr->next;
}
q->rear = ptr;
q->rear->next = NULL;
}
void dequeueF(QUEUE *q)
{
if(isEmpty(q))
{
printf("\nQueue is empty!!\n");
return;
}
printf("\nElement dequeued - %d\n", q->front->data);
q->front = q->front->next;
}
void display(QUEUE *q)
{
node temp;
temp = q->front;
if(isEmpty(q))
{
printf("\nQueue is empty!!\n");
return;
}
printf("\nQueue - \n");
while(temp!=NULL)
{
printf("%d <- ", temp->data);
temp = temp->next;
}
printf("\n");
}
int main()
{
QUEUE *q;
q = (QUEUE*)malloc(sizeof(QUEUE));
enqueueR(q, 2);
enqueueR(q, 3);
enqueueF(q, 1);
enqueueF(q, 0);
enqueueR(q, 4);
display(q);
dequeueF(q);
display(q);
dequeueR(q);
display(q);
}