3.出栈 void Pop(StACK*S, StackEntry *item) if( StackEmpty(2S)exit(“ Stack is empty”); else item=s->top->item; p=S->top S->top=p->next; free(p); 请单赤鼠标左键换页!3. 出栈 void Pop(STACK*S, StackEntry *item) { if (StackEmpty(*S)) exit(“Stack is empty”); else { *item=S->top->item; p=S->top; S->top=p->next; free(p); } }