c语言栈的各种基本运算代码

少年易学老难成，一寸光阴不可轻•少年易学老难成，一寸光阴不可轻•百度文库#题目：实现顺序栈的各种基本运算，并在此基础上设计一个主程序完成如下功能:(I)初始化栈S；⑵判断栈S是否为空；(3)依次使元素a,b,c,d,e进栈；⑷判断栈S是否为空；⑸输出栈的长度；(6)输出从栈顶到栈底元素；(7)输出出栈序列；(8)判断顺序栈S是否为空；(9)释放栈代码；#iiiclude<stdio.h>#mclude<malloc.h>#defineMaxSize50typedefcharElemType;typedefstiuct(ElemTypedata[MaxSize];inttop; 〃栈顶指针JSqStack;〃顺序栈顶类型定义〃初始化栈voidInitStack(SqStack*&s)(s=(SqStack*)malloc(sizeof(SqStack));s->top=-l;}〃销毁栈voidCleaiStack(SqStack*&s)(free(s);}〃求栈的长度mtStackLength(SqStack*s)(retuin(s->top+l);)〃判断栈是否为空mtStackEmpty(SqStack*s)retuin(s->top=-1);}〃进栈mtPush(SqStack*&s,ElemTypee)(if(s->top=MaxSize-1)return0;s->top-H-;s->data[s->top]=e;return1;}〃出栈mtPop(SqStack*&s,ElemType&e)(if(s->top=-l)return0;e=s->data[s->top];s->top-;return1;}//取出栈顶元素mtGetTop(SqStack*s,ElemType&e)(if(s->top=-l)return0;e=s->data[s->top];return1;}〃显示栈中元素voidDispStack(SqStack*s)(mti;fdr(i=s->top;i>=0;i-)prmtf(H%cH,s->data[i]);pnntfC，\nM);}mtmam()(ElemTypee;SqStack*s;pnntfC初始化栈s\n”);IiutStack(s);pnntf(”栈S为%s\n”，(StackEmpty(s)?”空H:“非空"));pHntf("一次进栈元素a,b,c,d,e;\n");Push(s,4)；Push(s,'b');Push(s；c);Push(s；d);Push(s；e);pnntf("栈S为％$\11"，(StackEmpty(s)?"空":“非空"));pHntf("输出栈长度S=%d：\nf,,StackLength(s));pnntf("输出从栈顶到栈底的元素：")；DispStack(s);GetTop(s,e);pHntf("显示栈顶元素：%c",e);pnntfC，")；pnntf("输出出栈序列：)while(?StackEmpty(s))(Pop(s,e);pnntf(”%c”,e);}pnntf(”栈S为%s\n”,