链式队列的实现

typedef struct QNode
{
DataType data;
struct QNode* next;
}LQNode, *QueuePtr;


typedef struct
{
QueuePtr front;
QueuePtr rear;
}LinkQueue;


void InitQueue(LinkQueue *LQ)
{
LQ->front=LQ->rear=(LQNode*)malloc(sizeof(LQNode));
if(LQ->front == NULL)
exit(-1);
LQ->front->next = NULL;
}


int QueueEmpty(LinkQueue LQ)
{
if(LQ.rear->next == NULL)
return 1;
else
return 0;
}


int EnterQueue(LinkQueue *LQ, DataType e)
{
LQNode *s
s= (LQNode*)malloc(sizeof(LQNode));
if(!s)
exit(-1);
s->data = e;
s->next = NULL;
LQ->rear->next = s;
LQ->rear = s
return 1;
}


int DeleteQueue(LinkQueue *LQ, DataType *e)
{
LQNode *s;
if(LQ->front == LQ->rear)
return 0;
else
{
s=LQ->front->next;
*e = s->data;
LQ->front->next = s->next;
if(LQ->rear == s)
LQ->rear = LQ->front;
free(s);
return 1;
}
}


int GetHead(LinkQueue LQ, DataType *e)
{
LQNode *s;
if(LQ.front == LQ.rear)
return 0;
else
{
s=LQ.front->next;
*e = s->data;
return 1;
}
}


void ClearQueue(LinkQueue *LQ)
{
while(LQ->front!=NULL)
{
LQ->rear = LQ->front->next;
free(LQ->front);
LQ->front = LQ->rear;
}
}