数据结构：链表+面向对象 实现队列

MyQueue.h

#pragma once
#include <iostream>

using namespace std;

template<class T>
struct Node {
	T data;
	Node<T>* next;
};

template<class T>
class MyQueue {
private:
	Node<T>* head;//头指针
	int count;//队列元素数量
public:
	MyQueue();
	~MyQueue();
	void outPrint();//打印队列元素
	void push(const T& e);//元素入队
	void top();// 返回队首元素
	void pop();//弹出队首元素
	int getCount();

};
template <class T>
MyQueue<T>::MyQueue() {
	count = 0;
	head = NULL;
}

template <class T>
MyQueue<T>::~MyQueue() {
	if (head == NULL) {
		cout << "已为空队列" << endl;
	}
	else {
		Node<T>* temp;
		while (head != NULL) {
			temp = head;
			head = head->next;
			delete temp;
			count -= 1;
		}
		cout << "析构函数已完成" << endl;
		cout << "队列元素个数为" << count << endl;
	}
}

template<class T>
int MyQueue<T>::getCount() {
	cout << "队列元素个数为： " << count << endl;
	return count;
}

template<class T>
void MyQueue<T>::push(const T& e) {//元素从链表头入队列
	//if (e <= 0) {
	//	cout << "请输入正数值" << endl;
	//	return;
	//}
	if (count == 0) {
		Node<T>* node = new Node<T>;//此处留意,声明新节点，不使用new初始化会报错
		node->data = e;
		node->next = NULL;
		head = node;


	}
	else {
		Node<T>* temp = head;
		for (int i = 0; i < count - 1; i++) {
			temp = temp->next;
		}
		Node<T>* node = new Node<T>;
		temp->next = node;
		node->data = e;
		node->next = NULL;
	}
	count++;//队列元素数量加1
}

template <class T>
void MyQueue<T>::outPrint() {
	if (head == NULL) {
		cout << "空队列" << endl;
	}
	else {
		Node<T>* temp = head;
		cout << "队列元素为：";
		while (temp != NULL) {
			cout << temp->data << " ";
			temp = temp->next;
		}
		cout << endl;

	}
}

template <class T>
void MyQueue<T>::top() {
	if (head == NULL) {
		cout << "这是空队列，无队首元素。" << endl;
	}
	else {
		Node<T>* temp;
		temp = head;
		head = head->next;
		cout << "弹出队首元素：" << temp->data << endl;
		delete temp;
		count -= 1;
	}
}

template <class T>
void MyQueue<T>::pop() {
	if (head == NULL) {
		cout << "此为空队列，无队首元素。" << endl;
		return;
	}
	else {
		cout << "队首元素为：" << head->data << endl;
	}
}

testMyQueue.cpp

#include "MyQueue.h"
#include <iostream>


int main()
{
	MyQueue<char>Q;
	char a[] = { 'a', 'c','r','r','e','w' };
	for (int i = 0; i < 5; i++) {
		Q.push(a[i]);
	}
	Q.outPrint();// 打印队列
	Q.top();//弹出队首元素
	Q.pop();//打印队首元素
	Q.top();
	Q.getCount();//获取队列元素数量
	Q.top();
	Q.top();
	Q.outPrint();
	Q.top();
	Q.top();
	Q.pop();
	return 0;
}

运行结果：