队列的实现

#include <iostream>
using namespace std;
typedef int QElemType;
typedef struct QNode
{
QElemType data;
struct QNode *next;
}QNode,*QueuePtr;
typedef struct
{
QueuePtr front;
QueuePtr rear;
}LinkQueue;
bool InitQueue(LinkQueue &Q)
{
Q.front=Q.rear=(QueuePtr)malloc(sizeof(QNode));
if(!Q.front) return 0;
Q.front->next=NULL;
return 1;
}
bool EnQueue(LinkQueue &Q,QElemType e)
{
QueuePtr p;
p=(QueuePtr)malloc(sizeof(QNode));
if(!p) return 0;
p->data=e;
p->next=NULL;
Q.rear->next=p;
Q.rear=p;
return 1;
}
bool DeQueue(LinkQueue &Q,QElemType &elem)
{
QueuePtr p;
if(Q.front=Q.rear) return 0;
p=Q.front->next;
elem=p->data;
Q.front->next=p->next;
if(Q.rear==p) Q.rear=Q.front;
free(p);
return 1;
}
void PrintQueue(LinkQueue &Q)
{
QueuePtr p;
p=Q.front->next;
while(p)
{
cout<<p->data<<"  ";
p=p->next;
}
cout<<endl;
}
int main()
{
int num,i;
QElemType elem;
LinkQueue queue;
InitQueue(queue);
cout<<"Please input the mount that you want to input:"<<endl;
cin>>num;
for(i=0;i<num;i++)
{
cout<<"Please input the value that you want to input:"<<endl;
cin>>elem;
EnQueue(queue,elem);
}
PrintQueue(queue);
return 0;
}