链队列的操作

#include<stdio.h>/*链队列的操作(初始化，入队，出对，销毁，输出)*//*2009.08.22*/#include<stdlib.h>#include <malloc.h>#define FALSE 0 #define TRUE 1typedef int QueueElemType;typedef struct Node{ QueueElemType data; struct Node *next;}LinkQueueNode;typedef struct{ LinkQueueNode * front; LinkQueueNode * rear;}LinkQueue;int InitQueue(LinkQueue *Q)//初始化Q为一个空链队列{ Q->front=(LinkQueueNode *)malloc(sizeof(LinkQueueNode)); if(Q->front!=NULL) { Q->rear=Q->front; Q->front->next=NULL; return TRUE; } else return FALSE;}int EnterQueue(LinkQueue *Q,QueueElemType x)//入队列{ LinkQueueNode *NewNode; NewNode=(LinkQueueNode *)malloc(sizeof(LinkQueueNode)); if(NewNode!=NULL) { NewNode->data=x; NewNode->next=NULL; Q->rear->next=NewNode; Q->rear=NewNode; return TRUE; } else return FALSE;}int DeleteQueue(LinkQueue *Q,QueueElemType *x)//出对{ LinkQueueNode *p; if(Q->front==Q->rear) return FALSE; p=Q->front->next; Q->front->next=p->next; if(Q->rear==p) Q->rear=Q->front; *x=p->data; return *x; free(p);}int DestroyQueue(LinkQueue *Q)//销毁队列{ while(Q->front) { Q->rear=Q->front->next; free(Q->front); Q->front=Q->rear; } return TRUE;}void print(LinkQueue *Q)//输出队列{ LinkQueueNode *P; if(Q->front==Q->rear) printf("The Queue is NULL!"); P=Q->front->next; for(;P!=NULL;P=P->next) printf("%d ",P->data);}void main(){ int max,i,value,x,m; LinkQueue QU; InitQueue(&QU);//初始化队列QU printf("/nplease input the Queue Length:"); scanf("%d",&max); printf("/nplease input the Queue Value:"); for(i=0;i<max;i++) { scanf("%d",&value); EnterQueue(&QU,value);//入队 } printf("/nThe arealy Queue value is:"); print(&QU); m=DeleteQueue(&QU,&x);//出队列 printf("/nThe head-value of Queue is: "); printf("%d",m); printf("/nNow The Queue value Is:"); print(&QU); if(DestroyQueue(&QU)) printf("/n The Queue Destroy Successul! "); printf("/n");}