基本操作算法: 1.初始化栈S void InItStack(STACK*S) {s->top=-1;} 2.入栈 void Push(stacK*'S, Stack Entry item) f(S->top= MAX STACK-1)exit(“ Stack is fu”); else s->item[++S->top]=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; }