栈的基本性质

#include<stdio.h>
#include<stdlib.h>
#define FALSE 0
#define TRUE 1
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
typedef int SElemType;
typedef int Status;
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
typedef struct{
SElemType *base;
SElemType *top;
int stacksize;
}SqStack;
Status InitStack(SqStack &s)//初始化栈
{ s.base=(SElemType *)malloc(STACK_INIT_SIZE*sizeof(SElemType));
if(!s.base)exit(OVERFLOW);
s.top=s.base; s.stacksize=STACK_INIT_SIZE;
return OK;
}
Status ClearStack(SqStack &s)//清空栈
{ s.top=s.top; return OK; }
Status DestroyStack(SqStack &s)//销毁栈
{ free(s.base); return OK; }
Status StackEmpty(SqStack S)//判断栈是否为空
{ if(S.top==S.base) return 1;
else return 0;