Queue2链队列

链队列

 1 #include <iostream>
 using namespace std;
 template <class T>
 class Queue
 {
 private:
     struct node
     {
         T data;
         node * next;
         node():next(NULL) {}
         node(T d):data(d),next(NULL) {}
     };
     node * Front;
     node * rear;
     node * head;

 public:
     int Count;
     Queue()
     {
         node * tem = new node();
         Front = tem;
         rear  = tem;
         head = tem;
         Count = ;
     }
     bool isEmpty()
     {
         return Count == ;
     }
     void makeEmpty()
     {
         while(Front != NULL)
         {
             node * p = Front;
             Front = Front -> next;
             delete p;
         }
         Count = ;
     }
     void enQueue(T d)
     {
         node * tem = new node(d);
         rear -> next = tem;
         rear = rear -> next;
         Count++;
     }
     void printQueue()
     {
         node * cur = Front;
         while(cur != NULL)
         {
             cout<<cur -> data<<" ";
             cur = cur -> next;
         }
     }
     void outQueue()
     {
         cout<<Front->data<<" ";
         node * p = Front;
         Front = Front -> next;
         delete (p);
     }
     T getTop()
     {
         return Front->data;
     }
     void init()
     {
         Front = Front -> next;
         rear = rear -> next;
     }
 };
 int main()
 {
     Queue<int> dusk;

     for(int i =  ; i <  ; i++)
     {
         dusk.enQueue(i);
     }
     dusk.init();
     dusk.printQueue();
     cout<<endl;
     cout<<dusk.getTop();

 }