泛型编程实现队列

#ifndef _QUEUE_H_
#define _QUEUE_H_
template<typename T>
class Node
{
public:
T data;
Node<T> *next;
};


template<typename T>
class Queue
{
public:
Queue()
{
front = rear = nullptr;
size = 0;
}
~Queue()
{
while (!IsEmpty())
{
Pop();
}
}
void Push(const T& data)
{
Node<T>* temp = new Node<T>;
temp->data = data;
temp->next = nullptr;
if (IsEmpty())
{
front = rear = temp;
}
else
{
rear->next = temp;
rear = temp;
}
++size;
}
void Pop()
{
if (IsEmpty())
{
return;
}
Node<T>* temp = front;
front = front->next;
delete temp;
--size;
}
bool IsEmpty() const
{
return size == 0;
}
T Top()
{
return front->data;
}
T Botton()
{
return rear->data;
}
private:
Node<T>* front;
Node<T>* rear;
int size;
};

#endif

测试：

#include "Queue.h"
#include <iostream>
using namespace std;
int main()
{
Queue<int> queue;
int x;
while (cin >> x, x)
{
queue.Push(x);
}
while (!queue.IsEmpty())
{
cout << queue.Top() << " ";
queue.Pop();
}
cout << endl;
cin >> x;
return 0;
}