#include<stdio.h>
#include<stdlib.h>
#define QElemType int
#define OK 1
#define ERROR -1
typedef struct QNode
{
QElemType data;
struct QNode *next;
}QNode,*QueuePtr;
typedef struct
{
QueuePtr front;
QueuePtr rear;
}LinkQueue;
//初始化
void InitQueue(LinkQueue &Q)
{
Q.front=Q.rear=new QNode;
Q.front->next=NULL;
}
//入队
void EnQueue(LinkQueue &Q,QElemType e)
{
QNode *p;
p=new QNode;
p->data=e;
p->next=NULL;
Q.rear->next=p;
Q.rear=p;
}
//出队
int 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;
}
//取队头元素
int GetHead(LinkQueue Q)
{
if(Q.front!=Q.rear)
return Q.front->next->data;
}
int main()
{
int a;
LinkQueue Q;
InitQueue(Q);
EnQueue(Q,5);
EnQueue(Q,10);
DeQueue(Q,a);
printf("%d\n",a);
a=GetHead(Q);
printf("%d\n",a);
return 0;
}