int StackEmpty (LinkStack *S)t return S->top=- NULL; int Pop( Link Stack *S, Stack Data &x i if( StackEmpty(S))return 0 StackNode *p=S->top S->top=p->links x=p->data free(p); return 1int StackEmpty (LinkStack *S) { return S->top == NULL; } int Pop ( LinkStack *S, StackData &x ) { if ( StackEmpty (S) ) return 0; StackNode * p = S->top; S->top = p->link; x = p->data; free (p); return 1; }