链式队列的入队和出队

#include<iostream>
using namespace std;
typedef struct node
{
	int data;
	node* next;
};
class Queue
{
private:
	node* front, * rear;
public:
	Queue()
	{
		front = new node;
		
		front->next = NULL;
			rear = front;
	}
	void EnQueue()
	{
		cout << "队列元素个数" << endl;
		int n;
		cin >> n;
		for (int i = 0; i < n; ++i)
		{
			node* p = new node;
			cin >> p->data;
			
			
				rear->next = p;
				rear = p;
			
		}
		rear->next = NULL;
	}
	void DeQueue()
	{


		for (node* p = front->next; p;)
		{
			
			cout << p->data << endl;
			node* q = p->next;
			if (q == rear) rear = front;
			delete p;
			p = q;
		}

	}
};
int main()
{
	Queue queue;
	queue.EnQueue();
	queue.DeQueue();
}