#include<iostream.h>         

template<class T>        
struct STU 
{
	T data;
	STU<T> * next;
};

template<class T>        
class LinkStack  
{  
public:  
	 LinkStack(){top=NULL;}   
	 ~LinkStack(); 
	 void Push(T x);
	 T Pop();
	 T GetTop(){if(top!=NULL)return top->data;};
	 int Empty(){top==NULL?return 1:return 0;};
private:  
	 STU<T> * top;
};  

template<class T>        
class LinkStack<T>::Push(T x)
{
	s=new STU;
	s->data=http://www.mamicode.com/x;>
“链栈”实际代码实现【物联网1132-11】