#include<stdio.h>
#include<malloc.h>
typedef int QElemType;
#define OVERFLOW 1
#define Status 0
#define OK 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=(QueuePtr)malloc(sizeof(QNode));
if(!Q.front) exit(OVERFLOW);
Q.front->next=NULL;
Q.front->data=NULL;
Q.rear->next =NULL;
}
//单链表队列插入节点
Status EnQueue(LinkQueue &Q,QElemType e)
{
QueuePtr s=(QueuePtr)malloc(sizeof(QNode));
if(!s) exit(OVERFLOW);
s->data = e;
s->next=NULL;
Q.rear->next=s;
Q.rear=s;
return OK
}
//单链表队列删除节点
Status DeQueue(LinkQueue &Q,ElemType &e)
{
QueuePtr p=Q.front->next;
if(Q.front==Q.rear) return ERROR
Q.front->next=P->next;
if(Q.rear==p) Q.rear=Q.front;
Free(p);
return OK;
}
//单链队列销毁
Status Drstroyqueue(LinkQueue &Q)
{
while(Q.front)
{
Q.rear =Q.front ->next;
free(Q.front);
Q.front=Q.rear;
}
return OK;
}
//判断队列是否为空
Status QueueEmpty(LinkQueue Q)
{
if(Q.front==Q.rear) return TRUE;
else return ERROR;
}
void main()
{
LinkQueue q;
InitQueue(q);
}