栈的部分操作

“#include <stdio.h>
#include <stdlib.h>
//函数结果状态码
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
#define STACK_INIT_SIZE 100
#define STACKINCREMENT
typedef int Status;
typedef int elemtype;
typedef struct{
elemtype *top;
elemtype *base;
int stacksize;
}Sqstack;
Status InitStack(Sqstack *S)
{
S->base = (elemtype *)malloc(STACK_INIT_SIZE*sizeof(elemtype));
if(!S->base) exit(OVERFLOW);
S->top = S->base;
S->stacksize = STACK_INIT_SIZE;
return OK;
}//初始化栈
Status Stackempty(Sqstack *S)
{
if(S->top == S->base)
return TRUE;
else
return FALSE;
}
Status Push(Sqstack *S,elemtype *e)
{
if(S->top-S->base>=S->stacksize)
{
S->base = (elemtype*)realloc(S->base,(S->stacksize+STACKINCREMENT)*sizeof(elemtype));
if(!S->base) exit(OVERFLOW);
S->top = S->base + S->stacksize;
S.stacksize = S.stacksize + STACKINCREMENT;
}
*S->top++ = e;
return OK;
}
Status Pop(Sqstack *S,elemtype *e)
{
if(Stackempty(Sqstack *S))
{
return ERROR;
}
e = *–S->top;
return OK;
}
int main()
{
return 0;
}“