队列的C语言实现：链式存储方式

/*
 * 队列：链式存储方式，带头结点，头节点的data用于保存队列中元素个数
 */
#include <stdio.h>
#include <stdlib.h>

typedef int bool;
#define true 1
#define false 0
#define ERROR -1

typedef struct node {
	int data;
	struct node *next;
} Node;

typedef struct Queue {
	Node *prior;
	Node *rear;
} Queue;

//初始化
Queue InitQueueTest() {
	Node *p = (Node*) malloc(sizeof(Node));
	if (!p)
		exit(ERROR);
	p->data = 0;
	p->next = NULL;
	Queue queue;
	queue.prior = p;
	queue.rear = p;
	return queue;
}

//入队列
void Offer(Queue *queue, int e) {
	Node *p = (Node*) malloc(sizeof(Node));
	if (!p)
		exit(ERROR);
	p->data = e;
	p->next = NULL;
//	关键步骤
	queue->rear->next = p;
	queue->rear = p;

	(queue->prior->data)++;
}

//出队列
int Poll(Queue *queue) {
	if (queue->prior == queue->rear)
		return false;
//	如果队列中只有一个元素
	if (queue->prior->next == queue->rear)
		queue->rear = queue->prior;
	Node *p = queue->prior->next;
	int e = p->data;
	queue->prior->next = p->next;
	(queue->prior->data)--;
	free(p);
	return e;
}

//判空
bool Empty(Queue queue) {
	return queue.prior == queue.rear ? true : false;
}

//队列长度
int QueueLength(Queue queue) {
	return queue.prior->data;
}

int main(void) {
	Queue queue = InitQueueTest();
	printf("%d\n", queue.prior->data);
	Offer(&queue, 3);
	Offer(&queue, 4);
	Offer(&queue, 5);
	printf("%d\n", queue.prior->data);
	printf("%d\n", Poll(&queue));
	Offer(&queue, 6);
	printf("%d\n", queue.prior->data);
	printf("%d\n", Poll(&queue));
	return 0;
}