數據結構---隊列的鏈表實現

#include
using namespace  std;
template<class T>
class queueNode
{
public:
T data;
queueNode* next;
};
template<class T>
class myqueue
{
private:
unsigned int queuelength;
queueNode<T>* node;
queueNode<T>* front;
queueNode<T>* rear;
public:
myqueue();
unsigned int length();
void push(T x);
bool isEmpty();
void pop();
T getHead();
};
template<class T>
myqueue<T>::myqueue()
{
node=NULL;
front=NULL;
rear=NULL;
queuelength=0;
};
template<class T>
unsigned int myqueue<T>::length()
{
return queuelength;
};
template<class T>
void myqueue<T>::push(T x)
{
node=new queueNode();
node->data=x;


if(rear!=NULL)
{
front=node;
rear=node;
}
else
{
rear->next=node;
rear=node;
}
++queuelength;
};
template<class T>
bool myqueue<T>::isEmpty()
{
return queuelength==0;
};
template<class T>
void myqueue<T>::pop()
{
if(queuelength==0)
return;
node=front;
front=front->next;
delete(node);
--queuelength;
};
template<class T>
T myqueue<T>::getHead()
{
return front->data;
};