链式栈操作实现 初始化 void Initstack( LinkStack *S)i 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;链式栈操作实现 ▪ 初始化 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; }