队的链式实现

#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
typedef char QElemType;
typedef int Status;
typedef struct QNode
{
 QElemType data;
    
 struct QNode *next;

} QNode,*QueuePtr;

typedef struct
{
  QueuePtr front;

  QueuePtr rear;

}LinkQueue;

Status InitQueue(LinkQueue *Q)
{
 Q->front=Q->rear=(QueuePtr)malloc(sizeof(QNode));//指向头结点
 if(!Q->front) exit(0);
 Q->front->next=NULL;
 return 1;
}

Status EnQueue (LinkQueue *Q,QElemType e)
{
  QueuePtr p;
  p=(QueuePtr)malloc(sizeof(QNode));
  p->data=e;
  p->next=NULL;
  Q->rear->next=p;
  Q->rear=p;
  return 1;
}

Status DeQueue (LinkQueue *Q)
{
  QueuePtr p;
  if(Q->front==Q->rear) return 0;
  p=Q->front->next;
  Q->front->next=p->next;
  if(Q->rear==p) Q->rear=Q->front;
  free(p);
  return 1;
}

Status GetHead(LinkQueue Q,QElemType *p)
{
 if(Q.front==Q.rear) return 0;
 *p=Q.front->next->data;
 return 1;
}

Status DestroyQueue(LinkQueue *Q)
{
  while(Q->front)
  {
    Q->rear=Q->front->next;
    free(Q->front);
    Q->front=Q->rear;
  }

  return 1;
}

Status TraverseQueue(LinkQueue *Q)
{
 QueuePtr p=Q->front->next;
 while(p)
 {
  printf("%c ",p->data);
  p=p->next;
 }
 return 1;

}

//测试呵呵！

void main()
{
  LinkQueue Q;
  char ch;
  int n;
  InitQueue(&Q);
  while((ch=getchar())!='@')
  {
    EnQueue (&Q,ch);
 
  }
  TraverseQueue(&Q);
  printf("\n");
  printf("请输入要出队的元素的个数\n");
  scanf("%d",&n);
  while(n>0)
  {
    DeQueue (&Q);
 n--;
  }
  TraverseQueue(&Q);
}