队列的链式表现和实现

#include<iostream>
using namespace std;
#define maxsize 100;
typedef int elemtype;
typedef struct qnode
{
	elemtype data;
	struct qnode* next;
}qnode,*queueptr;
typedef struct
{
	queueptr front;
	queueptr rear;
}linkqueue;
bool initqueue(linkqueue& q)//链队列初始化
{
	q.front = q.rear = new qnode;
	if (!q.front)
	{
		exit(-1);
	}
	q.front->next = NULL;
	return 1;
}
bool destroyqueue(linkqueue& q)//销毁链队列
{
	qnode* p;
	while (q.front)
	{
		p = q.front->next;
		delete q.front;
		q.front = p;
	}
	return 1;
}
bool enqueue(linkqueue& q, elemtype e)//链队列入队
{
	qnode* p = new qnode;
	if (!p)
	{
		exit(-1);
	}
	p->data = e;
	p->next = NULL;
	q.rear->next = p;
	q.rear = p;
	return 1;
}
bool dequeue(linkqueue& q, elemtype& e)//链队列出队
{
	if (q.front == q.rear)
	{
		return 0;
	}
	qnode* p;
	p = q.front->next;
	e = p->data;
	q.front->next = p->next;
	if (q.front->next == NULL)
	{
		q.rear = q.front;
	}
	delete p;
	return 1;
}
bool gethead(lintqueue q, elemtype& e)//求队列的队头元素
{
	if (q.front == q.rear)
	{
		return 0;
	}
	e = q.front->next->data;
	return 1;
}