用链表实现队列_用链表的方式实现队列-CSDN博客

本文链接：https://blog.csdn.net/Sanalar/article/details/48931689

本文详细介绍了如何使用链表来实现队列的数据结构。通过具体步骤和示例，展示了链表队列的基本操作，包括入队、出队以及队列的满和空判断。读者将能够理解链表作为队列的优势，并学会实际操作链表队列的方法。

摘要由CSDN通过智能技术生成

源代码：

#include<iostream>

using namespace std;

struct Node
{
	int n;
	Node * next;
};
Node * pTail = NULL;

void enter(Node * &pHead, int x)
{
	Node * pNew = new Node;
	pNew->n = x;
	pNew->next = NULL;
	if (!pHead)
	{
		pHead = pNew;
		pTail = pNew;
	}
	else
	{
		pTail->next = pNew;
		pTail = pNew;
	}
}

int del(Node * &pHead)
{
	if (!pHead)
	{
		return 0;
	}
	int x = pHead->n;
	Node * p = pHead;
	pHead = pHead->next;
	delete p;
	return x;
}

void printLink(const Node *pHead)
{
	Node * pNow = (Node *)pHead;
	while (pNow)
	{
		cout << pNow->n << " ";
		pNow = pNow->next;
	}
	cout << endl;
}

int main()
{
	Node * pHead = NULL;
	while (1)
	{
		cout << "**********菜单**********" << endl;
		cout << "        1.入队          " << endl;
		cout << "        2.出队          " << endl;
		cout << "        3.打印队列的内容 " << endl;
		cout << "        4.退出          " << endl;
		int x;
		cin >> x;
		if (x == 1)
		{
			cout << "请输入数字：";
			int n;
			cin >> n;
			enter(pHead, n);
		}
		if (x == 2)
		{
			cout << "出队：";
			cout << del(pHead) << endl;
		}
		if (x == 3)
		{
			cout << "打印队列的内容：";
			printLink(pHead);
		}
		if (x == 4)
		{
			break;
		}
	}
	return 0;
}

运行效果：