队列(链式存储)

#include<stdio.h>
#include<stdlib.h>

typedef struct Node
{
int data;
struct Node *next;
}QueueNode;

typedef struct
{
QueueNode *front,*rear;
}LinkQueue;

//初始化队列
LinkQueue *InitQueue(LinkQueue *Q)
{
QueueNode *p=(QueueNode *)malloc(sizeof(QueueNode));
Q=(LinkQueue *)malloc(sizeof(LinkQueue));
p->next=NULL;
Q->front=Q->rear=p;
return Q;
}

//判空
int QueueEmpty(LinkQueue *Q)
{
if(Q->front==Q->rear)
return 0;
else
return 1;
}

//入队
int EnQueue(LinkQueue *Q,int item)
{
QueueNode *q=(QueueNode *)malloc(sizeof(QueueNode));
q->data=item;
q->next=NULL;
Q->rear->next=q;
Q->rear=q;
}

//出队
int DeQueue(LinkQueue *Q,int *item)
{
if(!QueueEmpty(Q))
{
printf("LinkQueue is empty!\n");
return 0;
}
QueueNode *p=Q->front->next;
*item=p->data;
Q->front->next=p->next;
free(p);
if(Q->front->next==NULL)
Q->front=Q->rear;
return 1;
}

//取队首
int GetHead(LinkQueue *Q,int *item)
{
if(!QueueEmpty(Q))
{
printf("LinkQueue is empty!\n");
return 0;
}
*item=Q->front->next->data;
return 1;
}

//遍历队列
int QueueTraverse(LinkQueue *Q)
{
if(!QueueEmpty(Q))
{
printf("LinkQueue is empty!\n");
return 0;
}
QueueNode *p=Q->front->next;
while(p)
{
printf("%d ",p->data);
p=p->next;
}
printf("\n");
return 1;
}

int main()
{
LinkQueue *Q;
Q=InitQueue(Q);
}