Mr.zhou

//----顺序栈基本操作----- #include#include#include#define STACK_INIT_SIZE 10//存储空间初始分配量 #define STACKINCREMENT 5 //存储空间分配增量 #define OVERFALOW -2#define OK 1#define ERROR 0#define TRUE 1#define FALS

///链队列#include#include#define OK 1;#define ERROR 0#define TRUE 1#define FALSE 0#define OVERFLOW -2typedef int QElemType;typedef int Status;using namespace std;typedef struct QNode{ QElemTy

//链式栈 #include#include#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0typedef int SElemType;typedef int Status;using namespace std;typedef struct SNode{ SElemType data; stru