(C语言 C++) 数据结构：链队列的实现

//链队列
#include <iostream>

using namespace std;

#define ERROR 0
#define OK 1

typedef int QElemType;
typedef bool Status;

typedef struct QNode
{
	QElemType data;
	QNode* next;
} *QueuePtr; //QueuePtr是一个指针，指向QNode

typedef struct
{
	QueuePtr front; //队头指针 --> 一直指向头结点
	QueuePtr rear; //队尾指针 --> 一直指向尾结点
} LinkQueue;

//打印链队
void printQ(LinkQueue& Q)
{
	QueuePtr p = Q.front->next; //从首元节点开始打印
	while (p)
	{
		cout << p->data << " ";
		p = p->next;
	}
	cout << endl;
}
//初始化
void init(LinkQueue &Q)
{
	Q.front = Q.rear = new QNode; //初始状态下队头指针和队指针都指向头结点
	Q.front->next = nullptr;
}
//入队
void push(LinkQueue &Q, QElemType e)
{
	QueuePtr p = new QNode;
	p->data = e;
	p->next = nullptr;
	Q.rear->next = p;
	Q.rear = p; //更新尾指针的指向
}
//出队
Status pop(LinkQueue &Q, QElemType &e)
{
	if (Q.front == Q.rear) return ERROR; //队空

	QueuePtr p = Q.front->next; //p存储要出队的元素
	e = p->data;
	Q.front->next = p->next;

	if (p == Q.rear) Q.rear = Q.front;
	delete p;
}
//取队头元素
QueuePtr getFront(LinkQueue& Q)
{
	return Q.front->next; //若队列为空，返回空指针
}
//建立链栈，取队头，入队，出队操作测试
void test()
{
	LinkQueue Q;
	init(Q);

	cout << "入队和取队头操作测试：" << endl;
	cout << "将1-10入队：";
	for (int i = 1; i <= 10; i ++ ) push(Q, i);
	printQ(Q);
	cout << "此时队头为：" << getFront(Q)->data << endl;
	
	cout << endl;
	cout << "出队和取队头操作测试：" << endl;
	cout << "出队一次：";
	int e;
	pop(Q, e);
	printQ(Q);
	cout << "此时队头为：" << getFront(Q)->data << "，原来的队头为：" << e << endl;
	cout << "将剩余元素全部出队后再出队一次：";
	for (int i = 0; i < 9; i ++ ) pop(Q, e);
	if (!pop(Q, e)) cout << "此时队列已空，无法再出队，也无法取得队头元素！" << endl;
}
int main()
{
	//建立链栈，取队头，入队，出队操作测试
	test();

	return 0;
}