数据结构双语栈代码填空练习.pdfVIP

ID:：班级：

栈ADT

typedefstructStackRecord{typedefstructNode{

intTopOfStackElementTypeElement;

ElementType数组[MAXSIZE];structNode*Next;

}*Stack;}*Stack;

intIsEmpty(Stacks)intIsEmpty(Stacks)/*s包含头节点*/

{{

if(1)if(1)

return1;return1;

elsereturn0;elsereturn0;

}}

intIsFull(Stacks)

{voidPush(ElementTypeX,StackS)

if(②){

return1;StackTmpCell;

elsereturn0;TmpCell=malloc(sizeof(structNode));

}if(TmpCell==NULL)

returnERROR;

voidpop(Stacks)②

{③

if(IsEmpty(s))④

printf(“空栈”);}

③ElementTypeTop(StackS){

}if(!IsEmpty(S))

⑤

voidpush(Stacks,ElementTypex)returnERROR;

{}

if(IsFull(s))voidPop(StackS)

溢”);{

printf(“出

④;StackFirstCell;

}if(IsEmpty(S))