严蔚敏数据结构C语言版队列的链式存储方式

 一、队列的结构体定义

#include<stdio.h>
#include<stdlib.h>
#define ERROR -1
#define OK 1
typedef int 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)return ERROR;
	Q.front->next=NULL;
	return OK;
}

三、销毁队列 

Status DestroyQueue(LinkQueue &Q)
{
	if(!Q.front)return ERROR;
	QueuePtr p;
	while(Q.front->next)
	{
		p=Q.front->next;
		Q.front->next=p->next;
		free(p);
	}
	free(Q.front);
	Q.front=Q.rear=NULL;
	return OK;
}

四、入队

void EnQueue(LinkQueue &Q,QElemType e)
{
	if(!Q.rear)return;
	QueuePtr s=(QueuePtr)malloc(sizeof(QNode));
	s->data=e;
	Q.rear->next=s;
	s->next=NULL;
	Q.rear=s;
}

五、出队 

void DeQueue(LinkQueue &Q,QElemType &e)
{
	if(Q.front==Q.rear)return;
	QueuePtr s=Q.front->next;
	e=s->data;
	Q.front->next=s->next;
	if(Q.rear==s)Q.rear=Q.front;
	free(s);
}

六、遍历打印队列 

void PrintQueue(LinkQueue Q)
{
	printf("队列中的元素为：\n");
	if(!Q.front)return;
	for(QueuePtr p=Q.front->next;p;p=p->next)
	{
		printf("%d ",p->data);
		if((p->data-1)%5==0)puts("");
	}
	puts("\n");
}

总代码如下 

#include<stdio.h>
#include<stdlib.h>
#define ERROR -1
#define OK 1
typedef int 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);
Status DestroyQueue(LinkQueue &Q);
void DeQueue(LinkQueue &Q,QElemType &e);
void EnQueue(LinkQueue &Q,QElemType e);
void PrintQueue(LinkQueue Q);
int main()
{
	LinkQueue Q;
	InitQueue(Q);
	QElemType e;
	for(int i=19422130;i>=19422101;i--)EnQueue(Q,i);
	PrintQueue(Q);
	printf("删掉前十五个元素:\n");
	for(int j=1;j<=15;j++)
	{
		DeQueue(Q,e);
		printf("%d ",e);
		if((e-1)%5==0)puts("");
	}
	puts("\n");
	PrintQueue(Q);
	DestroyQueue(Q);
	return 0;
}
Status InitQueue(LinkQueue &Q)
{
	Q.front=Q.rear=(QueuePtr)malloc(sizeof(QNode));
	if(!Q.front)return ERROR;
	Q.front->next=NULL;
	return OK;
}
Status DestroyQueue(LinkQueue &Q)
{
	if(!Q.front)return ERROR;
	QueuePtr p;
	while(Q.front->next)
	{
		p=Q.front->next;
		Q.front->next=p->next;
		free(p);
	}
	free(Q.front);
	Q.front=Q.rear=NULL;
	return OK;
}
void DeQueue(LinkQueue &Q,QElemType &e)
{
	if(Q.front==Q.rear)return;
	QueuePtr s=Q.front->next;
	e=s->data;
	Q.front->next=s->next;
	if(Q.rear==s)Q.rear=Q.front;
	free(s);
}
void EnQueue(LinkQueue &Q,QElemType e)
{
	if(!Q.rear)return;
	QueuePtr s=(QueuePtr)malloc(sizeof(QNode));
	s->data=e;
	Q.rear->next=s;
	s->next=NULL;
	Q.rear=s;
}
void PrintQueue(LinkQueue Q)
{
	printf("队列中的元素为：\n");
	if(!Q.front)return;
	for(QueuePtr p=Q.front->next;p;p=p->next)
	{
		printf("%d ",p->data);
		if((p->data-1)%5==0)puts("");
	}
	puts("\n");
}

运行结果

队列中的元素为：
19422130 19422129 19422128 19422127 19422126
19422125 19422124 19422123 19422122 19422121
19422120 19422119 19422118 19422117 19422116
19422115 19422114 19422113 19422112 19422111
19422110 19422109 19422108 19422107 19422106
19422105 19422104 19422103 19422102 19422101


删掉前十五个元素:
19422130 19422129 19422128 19422127 19422126
19422125 19422124 19422123 19422122 19422121
19422120 19422119 19422118 19422117 19422116


队列中的元素为：
19422115 19422114 19422113 19422112 19422111
19422110 19422109 19422108 19422107 19422106
19422105 19422104 19422103 19422102 19422101