链式队列的基本操作

#include "iostream"
#define OK 1
#define ERROR 2
typedef int QElemType;
typedef int Status;
using namespace std;
typedef struct QNode
{
	QElemType data;
	struct QNode *next;
}QNode,*QeuePtr;
typedef struct
{
	QeuePtr front;
	QeuePtr rear;
}LinkQueue;
Status InitQueue(LinkQueue &Q)
{
	Q.front=Q.rear=new QNode;
	Q.front->next=NULL;
	return OK;
}
Status EnQueue(LinkQueue &Q,QElemType e)
{
	QNode *p;
	p=new QNode;
	p->data=e;
	p->next=NULL;
	Q.rear->next=p;
	Q.rear=p;
	return OK;
}
Status DeQueue(LinkQueue &Q,QElemType &e)
{
	QNode *p;
	if(Q.front==Q.rear) return ERROR;
	p=Q.front->next;
	e=p->data;
	Q.front->next=p->next;
	if(Q.rear==p) Q.rear=Q.front;
	delete p;
	return OK;
}
QElemType DetHead(LinkQueue Q)
{
	if(Q.front!=Q.rear)
	return Q.front->next->data;
}
int main()
{
	LinkQueue Q;
	InitQueue(Q);
	int n,i;
	cout<<"队的元素有:"<<endl;
	cin>>n;
	cout<<"入队的元素有:"<<endl;
	for(int i=1;i<=n;i++)
	{
		EnQueue(Q,i);
		cout<<"入队的元素是:"<<i<<endl;
	}
	cout<<"出队的元素有:"<<endl;
	while(Q.front!=Q.rear)
	{
		DeQueue(Q,i);
		cout<<"出队的元素是:"<<i<<endl;
	}
	
}