linkqueue.cpp

数据结构中

#include <iostream>
#include "LinkQueue.h"
using namespace std;
template <class T>
LinkQueue<T>::LinkQueue()
{
node<T> *s; 
s=new node<T>;s->next=NULL; 
front=rear=s;}

template <class T>
LinkQueue<T>::~LinkQueue()
{ }

template <class T>
void LinkQueue<T>::EnLinkQueue(T x)
{node<T> *s;
 s=new node<T>; s->data=x;
 s->next=NULL;
 rear->next=s;
 rear=s;
}

template <class T>
T LinkQueue<T>::DeLinkQueue()
{    T   x;
     char flag;
     node<T> *p;
     if(front==rear) throw flag;
     else { p=front->next; x=p->data;
            front->next=p->next;
           if(p->next==NULL) rear=front;
           delete p;
           return x;}
}

template <class T>
T LinkQueue<T>::GetQueue()
{ char flag;
 if(front==rear) throw flag;
 else return(front->next->data);
}

template <class T>
bool LinkQueue<T>::Empty()
{ if(front==rear) return 1;
  else return 0;
}


template <class T>
void LinkQueue<T>::PrintQueue()
{ char flag;
  node<T> *p;
	  p=front->next;
       while(p)
        {
               cout<<p->data;
               p=p->next;
        
        }

}