-
Notifications
You must be signed in to change notification settings - Fork 0
/
queue.c
55 lines (44 loc) · 1.12 KB
/
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
#include <stdio.h>
#include <stdlib.h>
#include "queue.h"
void initQueue(Queue* queue) {
queue->front = NULL;
queue->rear = NULL;
queue->size = 0;
}
int isQueueEmpty(Queue* queue) {
return queue->size == 0;
}
void enqueue(Queue* queue, double value) {
QueueNode* newNode = (QueueNode*)malloc(sizeof(QueueNode));
if (newNode == NULL) {
printf("Error: Memory allocation failed\n");
exit(EXIT_FAILURE);
}
newNode->data = value;
newNode->next = NULL;
if (isQueueEmpty(queue)) {
queue->front = newNode;
queue->rear = newNode;
}
else {
queue->rear->next = newNode;
queue->rear = newNode;
}
queue->size++;
}
double dequeue(Queue* queue) {
if (isQueueEmpty(queue)) {
printf("Error: Queue is empty\n");
exit(EXIT_FAILURE);
}
QueueNode* frontNode = queue->front;
double value = frontNode->data;
queue->front = frontNode->next;
free(frontNode);
if (queue->front == NULL) {
queue->rear = NULL;
}
queue->size--;
return value;
}