#include <iostream>
using namespace std;
template <class T> class LinkStack;
template <class T>
class LinkNode
{
friend class LinkStack<T>;
public:
private:
LinkNode(const T &dt, LinkNode *node = 0) :data(dt), link(node) {}
T data;
LinkNode *link;
};
template <class T>
class LinkStack
{
public:
LinkStack() { pop = 0; }
void Push(const T &data); //压栈
T & Top(); //获取栈顶元素
T Pop(); //弹出栈顶元素
bool isEmpty(); //判断栈是否为空
void makeEmpty(); //清空栈
~LinkStack();
private:
LinkNode<T> *pop;
};
template <class T>
void LinkStack<T>::Push(const T &data)
{
pop = new LinkNode<T>(data,pop);
}
template <class T>
T& LinkStack<T>::Top()
{
if (isEmpty()) throw "stack is empty";
else
return pop->data;
}
template <class T>
T LinkStack<T>::Pop()
{
if (isEmpty()) throw "stack is empty";
else
{
LinkN
C++链式栈
最新推荐文章于 2023-11-16 16:22:43 发布