stack.h

来自「非常完美地二叉搜索树模板～～～～ 希望大家能够喜欢」· C头文件 代码 · 共 73 行

#ifndef STACK_CLASS
#define STACK_CLASS

#include <iostream.h>
#include <assert.h>

template <class T>
class Stack;

template <class T>
class StackNode
{
	friend class Stack<T>;

private:
	T data;
	StackNode<T> *link;
	StackNode(T d=0,StackNode<T> *l=NULL):data(d),link(l){}

};

template <class T>
class Stack
{
public:
	Stack():top(NULL){}
	~Stack();
	void Push(const T & item);
	T Pop();
	T GetTop();
	void MakeEmpty();
	int IsEmpty()const {return top==NULL;}
private:
	StackNode<T> *top;
};

template <class T>
Stack<T>::~Stack()
{
	StackNode<T> *p;
	while(top!=NULL)
	{
		p=top;
		top=top->link;
		delete p;
	}
}

template <class T>
void Stack<T>::Push(const T & item)
{
	top=new StackNode<T> (item,top);
}

template <class T>
T Stack<T>::Pop()
{
	assert(!IsEmpty());
	StackNode<T> *p=top;
	T value=top->data;
	top=top->link;
	delete p;
	return value;
}

template <class T>
T Stack<T>::GetTop()
{
	assert(!IsEmpty());
	return top->data;
}

#endif