数据结构：链队列基本操作及其实现

//链队列
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include <stdlib.h>
#include <corecrt_math.h>
typedef int Status;
typedef int QElemType;
#define ERROR 0
#define OK 1
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(OVERFLOW);//存储分配失败
	Q.front->next = NULL;//将队头指针的后继节点初始化为空
	printf("初始化成功");
	return OK;
}
Status DestroyQueue(LinkQueue& Q)
{
	if (Q.front == 0) {
		printf("请先初始化队列!");
		return ERROR;
	}
	if (Q.front == Q.rear ) {
		printf("队列为空!");
		return ERROR;
	}
	while (Q.front)
	{
		Q.rear = Q.front->next;
		free(Q.front);
		Q.front = Q.rear;
	}//当队头指针存在时一直释放队头节点的内容，并将队头指针后移
	printf("销毁成功!");
	return OK;
}
Status EnQueue(LinkQueue& Q, int e)
{
	if (Q.front == 0) {
		printf("请先初始化队列!");
		return ERROR;
	}
	QueuePtr p= (QueuePtr)malloc(sizeof(QNode));//申请一个p指针用于遍历队列
	if (!p)exit(OVERFLOW);
	p->data = e;//将数据赋值为e
	p->next = NULL;
	Q.rear->next = p;
	Q.rear = p;
	return OK;
}
Status DeQueue(LinkQueue& Q,int & e)
{
	if (Q.front == 0) {
		printf("请先初始化队列!");
		return ERROR;
	}
	if (Q.front == Q.rear ) {
		printf("队列为空!");
		return ERROR;
	}
	QueuePtr p;
	if (Q.front == Q.rear) return ERROR;
	p = Q.front->next;
	e = p->data;
	Q.front->next = p->next;
	if(Q.rear == p) Q.rear = Q.front;
	free(p);
	return OK;
}
Status PrintQueue(LinkQueue Q)
{
	if (Q.front == 0) {
		printf("请先初始化队列!");
		return ERROR;
	}
	QueuePtr p;
	if (Q.front == Q.rear) {
		printf("队列为空!");
		return ERROR;
	}
	p = Q.front->next;
	while (p) {
		
		printf("%d ", p->data);
		p = p->next;
	}
	return OK;
}
Status GetHead(LinkQueue& Q) {
	if (Q.front == 0) {
		printf("请先初始化队列!");
		return ERROR;
	}
	QueuePtr e;
	if (Q.front == Q.rear) {
		printf("队列为空!");
		return ERROR;
	}
	e = Q.front->next;
	printf("队头元素为:%d",e->data);
}
Status QueueLength(LinkQueue& Q) {
	if (Q.front == 0) {
		printf("请先初始化队列!");
		return ERROR;
	}
	QueuePtr p;
	if (Q.front == Q.rear) {
		printf("队列为空!");
		return ERROR;
	}
	int len = 0;
	p = Q.front->next;
	while (p) {

		len++;
		p = p->next;
	}
	printf("队长为%d", len);
	return OK;
}
Status QueueClear(LinkQueue& Q) {
	if (Q.front == 0) {
		printf("请先初始化队列!");
		return ERROR;
	}
	if (Q.front == Q.rear ) {
		printf("队列为空!");
		return ERROR;
	}
	QueuePtr p;
	p = Q.front->next;
	while (p)
	{
		QueuePtr q=p;
		p = p->next;
		free(q);
	}//当队头指针存在时一直释放队头节点的内容，并将队头指针后移
	printf("清空成功!");
	Q.rear = Q.front;
	return OK;
}
void OperateMenu()
{
	printf("\n........................\n");
	printf("1.入队元素    2.出队元素  \n");
	printf("3.销毁队列    4.打印队列  \n");
	printf("5.队头元素    6.队列长度  \n");
	printf("7.初始化队列  8.清空队列  \n");
	printf("0.退出程序");
	printf("\n........................\n");
	printf("输入你想执行的操作:");
}
void main1()
{
	LinkQueue Q{NULL};
	int n=0,a;
	int s;
	do
	{
		OperateMenu();
		scanf("%d", &n);
		switch (n)
		{

		case 1:
			printf("输入入队元素:");
			scanf("%d", &a);
			EnQueue(Q, a);
			break;
		case 2:
			s = DeQueue(Q, a);
			if (s!=0) {
			printf("出队元素的元素是:%d", a);
			}
			break;
		case 3:
			DestroyQueue(Q);
			break;
		case 4:
			PrintQueue(Q);
			break;
		case 5:
			GetHead(Q);
			break;
		case 6:
			QueueLength(Q);
			break;
		case 7:
			InitQueue(Q);
			break;
		case 0:
			printf("退出");
			break;
		case 8:
			QueueClear(Q);
			break;
		default:
			break;
		}
	} while (n);
}