出栈 int pop( seqStack*S, Stack Data &x)( 若栈空返回0,否则栈顶元素退出到x并返回1 if( stackEmpty()) return 0 (S->top); X=*(S->top); return 1▪ 出栈 int pop (SeqStack *S, StackData &x) { //若栈空返回0, 否则栈顶元素退出到x并返回1 if ( StackEmpty(S) ) return 0; --(S->top); x = *(S->top); return 1; }