链队运算算法

#include <iostream>
#include <malloc.h>
using namespace std;
typedef char ElemType;
typedef struct DataNode
{
	ElemType data;
	struct DataNode *next;
} DataNode;				//链队数据结点类型
typedef struct
{
	DataNode *front;
	DataNode *rear;
} LinkQuNode;			//链队类型
void InitQueue(LinkQuNode *&q)
{
	q = (LinkQuNode *)malloc(sizeof(LinkQuNode));
	q->front = q->rear = NULL;
}
void DestroyQueue(LinkQuNode *&q)
{
	DataNode *pre = q->front, *p;//p指向队头数据结点
	if (p != NULL)			//释放数据结点占用空间
	{
		p = pre->next;
		while (p != NULL)
		{
			free(pre);
			pre = p; p = p->next;
		}
		free(pre);
	}
	free(q);				//释放链队结点占用空间
}
bool QueueEmpty(LinkQuNode *q)
{
	return(q->rear == NULL);
}
void enQueue(LinkQuNode *&q, ElemType e)
{
	DataNode *p;
	p = (DataNode *)malloc(sizeof(DataNode));
	p->data = e;
	p->next = NULL;
	if (q->rear == NULL)		//若链队为空,则新结点是队首结点又是队尾结点
		q->front = q->rear = p;
	else
	{
		q->rear->next = p;	//将p结点链到队尾,并将rear指向它
		q->rear = p;
	}
}
bool deQueue(LinkQuNode *&q, ElemType &e)
{
	DataNode *t;
	if (q->rear == NULL)		//队列为空
		return false;
	t = q->front;				//t指向第一个数据结点
	if (q->front == q->rear)  //队列中只有一个结点时
		q->front = q->rear = NULL;
	else					//队列中有多个结点时
		q->front = q->front->next;
	e = t->data;
	free(t);
	return true;
}