seqstack.h

上传几个数据结构源代码

#include"Stack.h"
template<class T>
class SeqStack:public Stack<T>
{
	private:
		T *m_pData;
		int m_nLenth;
		int m_top;
    bool    Create(int max)
	{
		m_pData=new T[max];
		return true;
	}
	public:
	SeqStack(int max=20)
	{
		Create(max);
		m_nLenth=max;
		m_top=-1;
	}

	~SeqStack()
	{
		if(m_pData)
			delete m_pData;
	}
	bool IsFull()const
	{
		return m_top>=m_nLenth-1;
	}
	bool IsEmpty()const
	{
		return m_top<=-1;
	}
	void Pop()
	{
	    	m_top--;
	}
	void Push(T & x)
	{
		m_pData[++m_top]=x;
	}
    T Top()const
	{
		return m_pData[m_top];
	}



};