链队列

#include<iostream>
#include<string>
using namespace std;
template<class T>
struct Node{
T data;
Node<T>*next;
};
template<class T>
class Student{
public:
Student();
void enqueue(T x);
T dequeue();
T getqueue();
int empty(){
if(front==rear) return 1;
return 0;}
private:
Node<T> *front,*rear;
};
template<class T>
Student<T>::Student(){
Node<T> *s;
s=new Node<T>;
s->next=NULL;
front=rear=s;
}
template<class T>
void Student<T>::enqueue(T x){
Node<T> *s;
s=new Node<T>;
s->data=x;
s->next=NULL;
rear->next=s;
rear=s;
}
template<class T>
T Student<T>::dequeue(){
if(rear==front)throw "下溢";
Node<T> *p;
p=front->next;
T x=p->data;
front->next=p->next;
if(p->next==NULL) rear=front;
delete p;
return x;
}
void main(){
Student<string> stu;
string a[3]={"小明","小李","小栋"};
for(int i=0;i<3;i++){
stu.enqueue(a[i]);
}
cout<<stu.dequeue()<<endl;
}