forked from ShiChuanTaylors/Data-Structure-Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueue.c
More file actions
156 lines (127 loc) · 2.72 KB
/
Queue.c
File metadata and controls
156 lines (127 loc) · 2.72 KB
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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
/* Data Structure and Algorithm - Queue
* Created by Ting Shi Chuan, Software Engineering Student
* Taylor's University
*/
#include <stdio.h>
typedef struct Element
{
int key;
/*possible other fields*/
}Element;
typedef struct QueueNode
{
Element elem;
struct QueueNode* next;
}QueueNode;
typedef struct Queue
{
QueueNode* first;
QueueNode* last;
int size;
}Queue;
Queue* createEmptyQueue(); //create empty queue
void addToQueue(Queue* q, Element e); //adds e to the end of the queue
Element removeFromQueue(Queue* q); //removes element at beginning and returns it
int isQueueEmpty(Queue* q); //tells whether the queue q is empty or not
int queueSize (Queue* q); //returns how many elements are inside the queue
void printQueue(Queue* q);
void main()
{
Queue* myQueue = createEmptyQueue();
int i;
Element e;
for(i = 0; i < 100; i+=10)
{
e.key = i;
addToQueue(myQueue, e);
}
/*
e.key = 88;
addToQueue(myQueue, e);
e.key = 110;
addToQueue(myQueue, e);
e.key = 210;
addToQueue(myQueue, e);
e.key = 4110;
addToQueue(myQueue, e);
*/
printQueue(myQueue);
while(!isQueueEmpty(myQueue))
{
printf("Key of element at queue front is %d\n", removeFromQueue(myQueue).key);
//printQueue(myQueue);
}
free(myQueue);
}
Queue* createEmptyQueue()
{
Queue* myQueue = (Queue*)malloc(sizeof(Queue));
myQueue->first = NULL;
myQueue->last = NULL;
myQueue->size = 0;
return myQueue;
}
void addToQueue(Queue* q, Element e)
{
QueueNode* newNode = (QueueNode*)malloc(sizeof(QueueNode));
newNode->elem = e;
newNode->next = NULL;
if(isQueueEmpty(q))
{
q->first = newNode;
q->last = newNode;
}
else
{
q->last->next = newNode;
q->last = q->last->next;
}
(q->size)++;
}
Element removeFromQueue(Queue* q)
{
Element e = q->first->elem;
QueueNode* deleteNode = q->first;
if(q->first->next != NULL)
q->first = q->first->next;
free(deleteNode);
(q->size)--;
return e;
}
int isQueueEmpty(Queue* q)
{
if(queueSize(q) == 0)
return 1;
else
return 0;
}
int queueSize (Queue* q)
{
return (q->size);
}
void printQueue(Queue* q)
{
printf("\n==Current Queue==\n");
int i;
QueueNode* cur = q->first;
printf(" Start\n");
printf(" | \n");
printf(" v \n");
for(i = 0; i < q->size; i++)
{
printf("________\n");
printf("| \t|\n");
printf("| %d\t|\n",cur->elem);
printf("|\t|\n");
printf("_________\n");
printf("|\t|\n");
printf("____|____\n");
printf(" | \n");
printf(" v \n");
if(cur->next != NULL)
cur = cur->next;
}
printf(" __\n");
printf(" |x|\n");
printf(" __\n");
}