顺序栈的基本运算: 判栈空 int StackEmpty(SeqStack *S)i if(S->top==S->base) return1/判栈空,空则返 回1 else return0;/则返回0 判栈满 int StackFull(SeqStack *S)t if( s->top-S->base > s-> StackSize )return 1 /判栈满,满则返回1 else return0;/否则返回0▪ 判栈空 int StackEmpty (SeqStack *S) { if( S->top == S->base ) return 1 //判栈空,空则返 回1 else return 0; //否则返回0 } ▪ 判栈满 int StackFull (SeqStack *S) { if( S->top- S->base >= S-> StackSize ) return 1 //判栈满,满则返回1 else return 0; //否则返回0 } 顺序栈的基本运算: