链队列

typedef struct QNode{
QElemType data;
struct QNode *next;
}QNode, *QueuePtr;


typedef struct
{
QueuePtr front, rear;
}LinkQueue;

bool EnQueue(LinkQueue *Q, QElemType e)
{
QueuePtr s  = (QueuePtr) malloc(sizeof(QNode));
if(!s )
exit(-1);
s->data = e;
s->next = NULL;
Q->rear->next = s;
Q->rear = s;
return true;
}

bool DeQueue(LinkQueue *Q, QElemType *E)
{
QueuePtr p;
if(Q->front == Q->rear)
{
return false;
}
p = Q->front->next;
*e = p->data;
Q->front->next = p->next;
if(Q->rear == p)
Q->rear = Q->front;
free(p);
return true;
}