栈的简单实现(c++版)

#define STACK_H_INCLUDED

template <class T>
class Stack{
private:
    int size;
    int top;
    T* contain;
public:
    Stack() : size(0), top(-1), contain(NULL) {}
    Stack(int MaxSize);
    void (T & element);
    T & top();
    void pop();
    bool isEmpty();
    void MakeEmpty();
};

#endif 

template <class T>
Stack<T>::Stack(int MaxSize)
{
    size = MaxSize;
    top = -1;
    contain = new T[size];
}

template <class T>
void Stack<T>::push(T & element)
{
    assert(tos != size - 1);
    contain[++top] = element;
}
template <class T>
void Stack<T>::pop()
{
    assert(top != -1);
    top--;
}

template <class T>
T& Stack<T>::top()
{
    assert(top != -1);
    return contain[top];
}

template <class T>
void Stack<T>::MakeEmpty()
{
    top = -1;
}

template <class T>
bool Stack<T>::isEmpty()
{
    return top == -1;
}