队列

template <class T>
class Hqueue
{
    public:
        Hqueue();
        virtual ~Hqueue();
        void insertQueue(T e);
        T deleteQueue();
        int getNumOfQueue(){ return num; }
    protected:
        struct node
        {
            T date;
            node* next;
        };
        node* front;
        node* rear;
        int num;
};

template <class T>
Hqueue<T>::Hqueue()
{
    num = 0;
    front = rear = new node;
    rear->next = NULL;
    if(NULL == front)
        exit(0);
}

template <class T>
Hqueue<T>::~Hqueue()
{
    node* p = front->next;
    while(p){
        delete front;
        front = p;
        p = front->next;
    }
    delete front;
}

template <class T>
void Hqueue<T>::insertQueue(T e)
{
    num++;
    node* p = new node;
    p->date = e;
    p->next = NULL;
    rear->next = p;
    rear = p;
}

template <class T>
T Hqueue<T>::deleteQueue()
{
    num--;
    T e = front->next->date;
    node* p = front->next;
    front->next = p->next;
    delete p;
    return e;
}