链队列实验

#ifndef Linkqueue_H
#define Linkqueue_H
template<class datatype>
struct Node
{datatype data;
Node<datatype>*next;};
template<class datatype>
class Linkqueue 
{public:
Linkqueue();
~Linkqueue();
void enqueue(datatype x);
datatype dequeue();
datatype getqueue();
int emypt();
private:
Node<datatype> *front,*rear;};

#endif;

#include"Linkqueue.h"
template<class datatype>
Linkqueue<datatype>::Linkqueue()
{Node<datatype>*s=NULL;
s=new Node<datatype>;
s->next=NULL;
front=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>
void Linkqueue<datatype>::enqueue(datatype x)
{Node <datatype>*s=NULL;
s=new Node<datatype>;
s->data=x;
s->next=NULL;
rear->next=s;rear=s;
}
template<class datatype>
datatype Linkqueue<datatype>::dequeue()
{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>::getqueue()
{if(front!=rear)
return front->next->data;
}
template<class datatype>
int Linkqueue<datatype>::emypt()
{if(front!=rear)
return 1;

else return 0;}

#include<iostream>
using namespace std;
#include "Linkqueue.cpp"
void main()
{Linkqueue<int<Q;
if(Q.emypt())
cout<<"队列为空"<<endl;
else
cout<<"队列非空"<<endl;
cout<<"对元素9和21执行入队操作:"<<endl;
try{
Q.enqueue(9);
Q.enqueue(21);}
catch(char*wrong)
{cout<<wrong<<endl;}
cout<<"查看队头元素："<<endl;
cout<<Q.getqueue()<<endl;
cout<<"执行出队操作:"<<endl;
try{
Q.dequeue();}
catch(char *wrong)
{cout<<wrong<<endl;}
cout<<"查看队头元素:"<<endl;

cout<<Q.getqueue()<<endl;}