-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueue.c
More file actions
60 lines (53 loc) · 1.13 KB
/
Copy pathqueue.c
File metadata and controls
60 lines (53 loc) · 1.13 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
/*C语言利用链表数据结构,实现队列的接口
* 文件名:queue.c
*/
#include "queue.h"
#include <stdio.h>
#include <stdlib.h>
queue *InitQueue()
{
queue *pqueue=(queue *)malloc(sizeof(queue));
pqueue->front=NULL;
pqueue->rear=NULL;
pqueue->size=0;
return pqueue;
}
node *EnQueue(queue *pqueue,QElemType e)
{
node *pNode=(node *)malloc(sizeof(node));
if(!pNode)
exit(0);
pNode->data = e;
pNode->next=NULL;
if(QueueEmpty(pqueue))
pqueue->front=pNode;
else
pqueue->rear->next = pNode;
pqueue->rear = pNode;
pqueue->size++;
return pNode;
}
node *DeQueue(queue *pqueue,QElemType *pe)
{
if(QueueEmpty(pqueue))
return NULL;
else
{
node *pNode = pqueue->front;
if(pe)
*pe=pNode->data;
pqueue->size--;
pqueue->front = pNode->next;
if(pqueue->size == 0)
pqueue->rear=NULL;
free(pNode);
return pqueue->front;
}
}
int QueueEmpty(queue *pqueue)
{
if(pqueue->front==NULL && pqueue->rear == NULL && pqueue->size ==0)
return 1;
else
return 0;
}