seqstack.h

来自「数据结构中有关栈的知识」· C头文件 代码 · 共 40 行

#include <iostream>
#include "stack.h"
using namespace std;
class seqstack:public stack
{
public:
	stack *top;
	//stack *bottom;

    seqstack();
	~seqstack();
	void push(char&);
	void pop(char&);
	bool isempty() {return (top->link==NULL)?1:0;}
	//void sort();
	stack *gethead() {return top;}
	friend ostream& operator <<(ostream& out,seqstack& l);
	friend istream& operator >>(istream& in,seqstack& l);
	void gettop(char &ch)   {ch=top->data;}
};


class seqstack1:public stack1
{
public:
	stack1 *top;
	//stack *bottom;

    seqstack1();
	~seqstack1();
	void push(int&);
	void pop(int&);
	bool isempty() {return (top->link==NULL)?1:0;}
	//void sort();
	stack1 *gethead() {return top;}
	friend ostream& operator <<(ostream& out,seqstack1& l);
	friend istream& operator >>(istream& in,seqstack1& l);
	void gettop(int &ch)   {ch=top->data;}
};