blob: 94361d1f018cef0dd258a4c1757b408b398a3bf7 (
plain)
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
|
#include "queue.h"
void InitQueue(pqueue * q)
{
*q = NULL;
}
bool EmptyQueue(pqueue * qhead)
{
if (!*qhead)
return true;
return false;
}
bool EnQueue(pqueue * qtail, ElemType * e)
{
pqueue new = (pqueue) malloc (sizeof(Queue));
if (!new)
return false;
new->data = *e;
new->next = NULL;
if (!*qtail)
*qtail = new;
else
{
(*qtail)->next = new;
*qtail = new;
}
return true;
}
bool DeQueue(pqueue * qhead, ElemType * e)
{
pqueue tmp = *qhead;
if (!*qhead)
return false;
*e = tmp->data;
*qhead = (*qhead)->next;
free(tmp);
return true;
}
bool RsQueue (pqueue * qhead)
{
if (EmptyQueue(qhead))
return false;
pqueue tmp = *qhead;
while (!*qhead)
{
tmp = (*qhead)->next;
free(*qhead);
*qhead = tmp;
}
return true;
}
bool PrintQueue (pqueue * qhead)
{
if (EmptyQueue(qhead))
return false;
pqueue tmp = *qhead;
while (tmp)
{
printf("%c", tmp->data);
tmp = tmp->next;
}
putchar('\n');
return true;
}
|
