2.入栈 void Push(staCK*S, StackEntry item) P=(NODE*)malloc(sizeof(NODE); if (p)exit(OVERFLOW) elsei p->item=item; p→>next=S>top; S->top=p 请单鼠标左键换页!2. 入栈 void Push(STACK *S,StackEntry item) { p=(NODE*)malloc(sizeof(NODE)); if (!p) exit(OVERFLOW); else { p->item=item; p->next=S->top; S->top=p; } }