-
Notifications
You must be signed in to change notification settings - Fork 50
/
Copy pathmy_queue.c
79 lines (64 loc) · 1.45 KB
/
my_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
#include <stdlib.h>
#include "my_queue.h"
myQueue *createNewQueue() {
MyQueue *queue = NULL;
queue = (MyQueue *)malloc(sizeof(struct MyQueue));
queue->head = 0;
queue->tail = 0;
}
bool isEmpty(MyQueue *queue) {
if (queue == NULL) {
return true;
}
if ((queue->head == 0) && (queue->tail == 0)) {
return true;
}
return false;
}
void enQueue(MyQueue *queue, void *data) {
QNode *newNode = NULL;
if (queue == NULL) {
return;
}
newNode = (QNode *)malloc(sizeof(struct QNode));
if (newNode == NULL) {
return;
}
newNode->value = data;
if ((queue->head == 0) && (queue->tail == 0)) {
queue->head = newNode;
queue->tail = newNode;
newNode->next = 0;
newNode->prev = 0;
} else {
newNode->next = queue->tail->next;
newNode->prev = queue->tail;
queue->tail = newNode;
}
}
void *deQueue(MyQueue *queue) {
if (queue == NULL) {
return NULL;
}
if (isEmpty(queue)) {
return NULL;
}
void *value = queue->head->value;
QNode *tmp = queue->head;
queue->head = queue->head->next;
if (queue->head != 0) {
queue->head->prev = 0;
}
free(tmp);
return value;
}
void destroyQueue(MyQueue *queue) {
QNode *tmp = queue->head;
QNode *now = queue->head;
while(now) {
tmp = now;
now = now->next;
free(tmp);
}
free(queue);
}