int Stack Empty(SeqStack *S)t //判断栈是否空?空则返回1.否则返回0 return S->to p int Stack Full(Seq Stack *S)& /判断栈是否满?满则返回1.否则返回0 return S->top= StackSize-1 void Initstack( SeqSstack*S){/置空栈 S->top=-1;int StackEmpty (SeqStack *S) { //判断栈是否空？空则返回1，否则返回0 return S->top == -1; } int StackFull (SeqStack *S) { //判断栈是否满？满则返回1，否则返回0 return S->top == StackSize-1; } void InitStack ( SeqStack *S) { //置空栈 S->top = -1; }