我的模板栈

template<typename T>
struct Node
{
    T data;
    Node<T>* next;
};

template<typename T>
class stack
{
    Node<T>* top;
public:
    stack():top(NULL){}
    void push(T n);
    T pop();
    bool stackEmpty();
    T getTop();
    ~stack(){}
    void print();
};

template<typename T>
void stack<T>::push(T n)
{
    Node<T>* r=new Node<T>;
    r->data=n;
    r->next=top;
    top=r;
}

template<typename T>
T stack<T>::pop()
{
    Node<T> *ptr = top;  
    top = top->next;
    T t=ptr->data;
    delete ptr;
    return t;
}


template<typename T>
void stack<T>::print()
{
    for(Node<T>* p=top;p;p=p->next)
        cout<<p->data<<"  ";
}

template<typename T>
T stack<T>::getTop()
{
    return top->data;
}

template<typename T>
bool stack<T>::stackEmpty()
{
    if(top)return false;
    else return true;
}