C++链式栈的模版

#if 0
//链式栈的模板
template <class T>
struct LinkNode 
{
T data;
LinkNode<T>* link;
LinkNode(LinkNode <T>* ptr = NULL )
{
link = ptr;
}
LinkNode(const T &item,LinkNode <T> *ptr = NULL)
{
data = item;
link = ptr;
}
};


const int maxSize = 50;
const bool{false,true};
template <class T>
class Stack
{
public:
Stack(){};
virtual bool Push(const T &x) = 0;
virtual bool Pop(T &x) = 0;
virtual bool getTop (T &x) const = 0;
virtual bool IsEmpty() const = 0;
virtual bool IsFull () const = 0;
virtual int getSize () const = 0;
};


template <class T>
class LinkedStack :public Stack<T>
{
public:
LinkedStack():top(NULL){}
~LinkedStack(){makeEmpty();}
void Push(const T& x);
bool Pop(T &x);
bool getTop(T &x)const;
bool IsEmpty()const {return top == NULL ? true: false;}
int getSize ()const;
void makeEmpty();
friend ostream & operator << (ostream &os, SeqStack<T>& s);
private:
LinkNode<T> *top;
};
template <class T>
LinkedStack<T>::makeEmpty()
{
LinkNode<T> *p;
while(top != NULL)
{
p = top;
top = top->link;
delete p;
}
};
template <class T>
void LinkedStack<T>::Push(const T& x)
{
top = new LinkNode <T> (x,top);
assert(top != NULL);
};
template <class T>
bool LinkedStack<T> ::Pop(T& x)
{
if(IsEmpty() == true )
return false;
LinkNode <T> *p = top;
top = top->link;
x = p ->data;
delete p;
return true;
};
template <class T>
bool LinkedStack<T>::getTop(T & x)const
{
if(IsEmpty() == true)
return false;
x = top->data;
return true;
};
template <class T>
int LinkedStack<T>::getSize()const
{
LinkNode<T> *p =top;
int k = 0;
while(top != NULL )
{
top = top->link;
k++;
}
return k;
};
template <class T>
ostream & operator << (ostream &os, LinkedStack <T>& s)
{
os<<"栈中的元素个数 ="<<s.getSize()<<endl;
LinkNode<T> *p = s.top;
int i = 0;
while(p != NULL)
{
os<<++i<<":"<<p->data <<endl;
p = p->link;
}
return os;
};
#endif