链式栈操作的实现 void InitStack( LinkStack =Si S->top- NULL; int Push( LinkStack*S, Stack Data x)( Stack Node *p=( StackNode %)malloc sizeof( StackNode ))i p->data=x; p->link=S->top; S->top=p; return 1;链式栈操作的实现 void InitStack ( LinkStack *S ) { S->top = NULL; } int Push ( LinkStack *S, StackData x ) { StackNode *p = ( StackNode * ) malloc ( sizeof ( StackNode ) ); p->data = x; p->link = S->top; S->top = p; return 1; }