基本操作算法: 1.初始化栈S void Inltstack(STACK *S i s->top=-1; 3 入栈 void Push(stackS, StackEntry item if(S>top= MAX STACK-)exit(“ Stack is ful”); else s->item[++S->topl=item 西师大学数学与信启学院෎ᴀ᪡԰ㅫ⊩˖ 1. ߱ྟ࣪ᷜS void InItStack(STACK *S) { s->top=-1; } 2. ܹᷜ void Push(STACK *S,StackEntry item) { if (S->top==MAX_STACK-1) exit(³Stack is full´); else S->item[++S->top]=item; }