链表

链表
#include
using namespace std;
template
class lq
{
public:
lq();
~lq();
void eq(DataType x);
DataType dq();
DataType gq();
int empty() {frontrear?return 1:return 0;}
private：
Node*front,*rear;
};
lq::lq()
{
s=new Node;
s->next=NULL;
front=rear=s;
}
void lq::eq(DataType x)
{
s=new Node;s->data=x;
s->next=NULL;
rear->next=s;
rear=s;
}
DataType lq::dq()
{
if(rearfront) throw"下溢";
p=front->next;
x=p->data;
front->next=p->next;
if(p->next=NULL) rear=front;
delete p;
return x;
}
int main()
{
int n,s,p;
cin>>n;
lq(int n);
eq();
dq();
cout<<lq()<<eq()<<dq()<<endl;
return 0;
}