简单数据结构的实现之链队列

#include <iostream>

using namespace std;

#ifndef LINKQUEUE_H_INCLUDED
#define LINKQUEUE_H_INCLUDED

template <class ElemType>
struct QNode
{
    ElemType data;
    QNode* next;
};
template <class ElemType>
class LinkQueue
{
    private:
    QNode<ElemType>* front;
    QNode<ElemType>* rear;
    public:
    LinkQueue();
    ~LinkQueue();
    void ClearQueue();
    bool QueueEmpty(){return front==rear;}
    int QueueLength();
    QNode<ElemType>* Front(){return front;}
    QNode<ElemType>* Rear(){return rear;}
    bool GetHead(ElemType& e);
    bool EnQueue(ElemType e);
    bool DeQueue(ElemType& e);
};
template <class ElemType>
LinkQueue<ElemType>::LinkQueue()
{
    front=rear=new QNode<ElemType>;
    front->next=NULL;
}
template <class ElemType>
LinkQueue<ElemType>::~LinkQueue()
{
    while(front)
    {
        rear=front->next;
        delete front;
        front=rear;
    }
}
template <class ElemType>
void LinkQueue<ElemType>::ClearQueue()
{
    QNode<ElemType>* p=front->next;
    while(p)
    {
        rear=p->next;
        delete p;
        p=rear;
    }
    rear=front;
    front->next=NULL;
}
template <class ElemType>
int LinkQueue<ElemType>::QueueLength()
{
    int i=0;
    QNode<ElemType>* p=front->next;
    while(p)
    {
        i++;
        p=p->next;
    }
    return i;
}
template <class ElemType>
bool LinkQueue<ElemType>::GetHead(ElemType& e)
{
    if(front==rear)
    {
        return false;
    }
    else
    {
        e=front->next->data;
        return true;
    }
}
template <class ElemType>
bool LinkQueue<ElemType>::EnQueue(ElemType e)
{
    QNode<ElemType>* p=new QNode<ElemType>;
    if(!p)
    {
        return false;
    }
    else
    {
        p->data=e;
        rear->next=p;
        rear=p;
        p->next=NULL;
        return true;
    }
}
template <class ElemType>
bool LinkQueue<ElemType>::DeQueue(ElemType& e)
{
    if(front==rear)
    {
        return false;
    }
    else
    {
        QNode<ElemType>* p=front->next;
        e=p->data;
        front->next=p->next;
        if(rear==p)
        {
            rear=front;
        }
        delete p;
        return true;
    }
}
#endif // LINKQUEUE_H_INCLUDED