单链表实现的栈

#ifndef STACK_H
#define STACK_H

#include<stdexcept>
#include<string>
using namespace std;

template<typename T>
class Stack
{
private:
    template<typename T>
    struct Node
    {
        T data;
        Node* next;
        Node(T data,Node* next):data(data),next(next){}
    };

    Node<T>* _top;
public:
    class StackEmptyException:public logic_error{
    public:
        StackEmptyException(const string& msg=""):logic_error(msg){}
    };

    Stack(){
        _top=0;
    }

    ~Stack(){
        while(_top){
            Node* next=_top->next;
            delete _top;
            _top=next;
        }
    }

    void push(T data){
        _top=new Node<T>(data,_top);
    }
    
    bool isEmpty(){
        return _top==0;
    }

    T top() throw(StackEmptyException){
        if(!isEmpty())
            return _top->data;
        else
            throw StackEmptyException();
    }

    void pop() throw(StackEmptyException){
        if(!isEmpty()){
            Node<T>*next=_top->next;
            delete _top;
            _top=next;
        }
        else
            throw StackEmptyException();
    }
};

#endif//STACK_H

欢迎大家批评指正哦O(∩_∩)O~