带模板的链队列

#include<iostream>
#include<list>
#include<assert.h>
using namespace std;
template<typename T>
class SqStack
{
private:
T *base,*top;
int stacksize;
int Length;
public:
SqStack(int k=1)
{
base = new T[k];
assert(base!=NULL);
top = base;
stacksize = k;
}
~SqStack()
{
delete []base;
}
bool push(T e)
{
T *newbase;
if(top-base == stacksize)
{
newbase = new T[stacksize*2];
if(newbase == NULL)
{
return false;
}
for(int j=0;j<top-base;j++)
{
*(newbase+j) = *(base+j);
}
delete[]base;
top = base+stacksize;
stacksize *=2;
}
*top++ = e;
return true;
}
bool Pop(T &e)
{
if(top == base)
{
return false;
}
e = *--top;
return true;
}
bool empty()
{
return top == base;
}
void length()const
{
cout<<top-base;
}
void Clear()
{
top = base;
}
void Traverse(void (*visit)(T*))const
{
T *p = base;
while(p<top)
{
visit(p++);
}
}
};
typedef int T;
inline void print(T* c)
{
cout<<*c<<" ";
}


template<typename T>
struct LNode
{
T data;
LNode<T> *next;
};
template<typename T>
class LinkList
{
protected:
LNode<T> *Head;
public:
LinkList()
{
Head=new LNode<T>;
assert(Head!=NULL);
Head->next=NULL;
}
bool ListDelete(int i,T &e)const
{
int j = 0;
LNode<T> *q, *p = Head;
while(p->next !=NULL && j<i-1)
{
j++;
p = p->next;
}
if(p->next == NULL || j>i-1)
{
return false;
}
q = p->next;
p->next = q->next;
e = q->data;
delete q;
return true;
}
};
template<typename T>
class LinkQueue : public LinkList<T>
{
private:
LNode<T> *rear;
public:
LinkQueue()
{
rear = Head;
}
bool EnQueue(T e)
{
LNode<T> *p;
p = new LNode<T>;
if(p == NULL)
{
return false;
}
p->data = e;
p->next = NULL;
rear->next = p;
rear = p;
return true;
}
bool DeQueue(T &e)
{
bool flag=ListDelete(1, e);
if(Head->next==NULL)
rear=Head;
return flag;
}
};


int main()
{
int  e;
LinkQueue <int> Qu;
Qu.EnQueue(1);
Qu.EnQueue(2);
Qu.DeQueue(e);
return 0;
}