数据结构：队列的链式储存

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
using namespace std;
typedef int Status;
typedef int QElemType;
typedef struct QNode
{
 QElemType data;
 struct QNode *next;
}QNode,*QueuePtr;
typedef struct
{
 QueuePtr front;
 QueuePtr rear;
}LinkQueue;
Status InitQueue(LinkQueue &Q)
{//构造一个空队列Q
 Q.front=Q.rear=(QueuePtr)malloc(sizeof(QNode));
 if(!Q.front) exit(0);
 Q.front->next=NULL;
 return 1;
}
Status DestroyQueue(LinkQueue &Q)
{//销毁队列
 while(Q.front){
  Q.rear=Q.front->next;
  free(Q.front);
  Q.front=Q.rear;
 }
 return 1;
}
Status EnQueue(LinkQueue &Q,QElemType e)
{//插入e为队尾元素
 QueuePtr p;
 p=(QueuePtr)malloc(sizeof(QNode));
 if(!p) exit(0);
 p->data=e;
 p->next=NULL;
 Q.rear->next=p;
 Q.rear=p;
 return 1;
}
Status DeQueue(LinkQueue &Q,QElemType &e)
{//若队列不为空，删除Q的队头元素，用e返回其值
 QueuePtr p;
 if(Q.front==Q.rear) return 0;
 p=Q.front->next;
 e=p->data;
 Q.front->next=p->next;
 if(Q.rear==p)Q.rear=Q.front;
 free(p);
 return 1;
}
int main()
{
 LinkQueue Q;
 int e1,e2,e3;
  InitQueue(Q);
  cout<<"入队"<<endl;
  cin>>e1;
  EnQueue(Q,e1);
   cout<<"入队"<<endl;
  cin>>e2;
  EnQueue(Q,e2);
  DeQueue(Q,e3);
  cout<<"队头元素"<<e3<<"出队"<<endl;  
}