用链式结构实现单链队列的入队与出对

#include<iostream>
using namespace std;
#include<stdlib.h>
#define MAXSIZE 100
#define OK  1
#define ERROR 0
typedef int QElemType ;
typedef struct QNode{
QElemType  data;
struct QNode *next;
}QNode,*QueuePtr;
typedef struct{
QueuePtr rear;
QueuePtr front;
}LinkQueue;

int InitQueue(LinkQueue &Q)   //构造一个空队列
{Q.front=Q.rear=(QueuePtr)malloc(sizeof(QNode));
if(!Q.front)  return ERROR;
Q.front->next=NULL;
return OK;
}

int EnterQueue(LinkQueue &Q,QElemType e)//入队
{QueuePtr p;

p=(QueuePtr)malloc(sizeof(QNode));
if(!p)  return ERROR;
p->data=e;
p->next=NULL; Q.rear->next=p;
Q.rear=p;
return OK;
}

int DeleteQueue(LinkQueue &Q,QElemType &e) //删除元素
{QueuePtr 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;
free (p);
return OK;
}
 
int OutPut(LinkQueue Q)
{QueuePtr q;
if(Q.rear==Q.front) return ERROR;
q=Q.front->next;
while(q)
{cout<<q->data<<" ";q=q->next;}
return OK;
}

int main()
{LinkQueue Q;
InitQueue(Q);
int e,i,n;
cout<<"输入队长：";
cin>>n;
for(i=0;i<n;i++)
{cout<<"插入数据元素e:";cin>>e;
EnterQueue(Q,e);
}
OutPut(Q);
cout<<"删除元素：";
DeleteQueue(Q,e);
OutPut(Q);
return OK;
}