实验三：链队列的实现

老师，改好了哈哈

#include<iostream>
using namespace std;
const int QSize=100;
template<class Datatype>
struct Node
{
Datatype data;
Node<Datatype> *next;
};
template<class Datatype>
class linkqueue
{
public:
linkqueue();
~linkqueue();
void en(Datatype x);
Datatype chu();
Datatype get();
int empty();
private:
Node<int>*front,*rear;
};
template<class Datatype>
linkqueue<Datatype>::linkqueue()
{
Node<Datatype>*s=NULL;
s=new Node<Datatype>;
s->next=NULL;
front=rear=s;
}
template<class Datatype>
void linkqueue<Datatype>::en(Datatype x)
{
Node<Datatype>*s=NULL;
s=new Node<Datatype>;
s->data=x;
s->next=NULL;
rear->next=s;rear=s;
}
template<class DataType>  
linkqueue<DataType>::~linkqueue()  
{  
    Node<DataType>*p=NULL;  
    while(front!=NULL)  
    {  
        p=front->next;  
        delete front;  
        front=p;  
    }  
}  
template<class Datatype>
Datatype linkqueue<Datatype>::chu()
{
Node<Datatype>*p=NULL;
int x;
if(rear==front)throw"下溢";
p=front->next;
x=p->data;
front->next=p->next;
if(p->next=NULL)rear=front;
delete p;
return x;
}




template<class Datatype>
Datatype linkqueue<Datatype>::get()
{
if(front!=rear)
    return front->next->data;
}
template<class Datatype>
int linkqueue<Datatype>::empty()
{
if(front==rear)
return 1;
else
return 0;
}
void main()
{
linkqueue<int>Q;
if(Q.empty())
cout<<"队列为空"<<endl;
else
cout<<"对15和10执行入队操作"<<endl;
try
{
Q.en(15);
Q.en(10);
}
catch(char*wrong)
{
cout<<wrong<<endl;
}
cout<<"查看队头元素"<<endl;
cout<<Q.get()<<endl;
cout<<"执行出队操作"<<endl;
try
{
Q.chu();
}
    catch(char*wrong)
{
cout<<wrong<<endl;
}
cout<<"查看队头元素"<<endl;
cout<<Q.get()<<endl;
}