(1.18)--链栈的基本运算.docVIP

#includestdio.h

#includestdlib.h

typedefintElemType;

//声明链栈结点结构体类型

typedefstructnode

{

ElemTypedata;

structnode*next;

}*linkStack,stackNode;

//带有头结点的链栈初始化

linkStackinitLinkStack()

{

linkStacktop=(linkStack)malloc(sizeof(stackNode));

if(!top)

{

printf(动态内存分配失败!\n);

exit(0);

}

else

{

top-next=NULL;

printf(链栈初始化成功!\n);

returntop;

}

}

//入栈

intpush(linkStacktop,ElemTypee)

{

if(top)

{

linkStackp=(linkStack)malloc(sizeof(stackNode));

p-data=e;

p-next=top-next;

top-next=p;

return1;

}

return0;

}

//出栈

intpop(linkStacktop,ElemType*e)

{

if(top-next)

{

linkStackp=top-next;

*e=top-next-data;

top-next=p-next;

return1;

}

return0;

}

//判断栈空

intisEmpty(linkStacktop)

{

if(top-next==NULL)

return1;

return0;

}

//获取栈顶元素

intgetTop(linkStacktop)

{

if(top-next)

{

returntop-next-data;

}

return-1;

}

intmain()

{

linkStacktop=initLinkStack();

intselect=0;

inte;

printf(\n链栈的基本运算如下：\n);

do{

printf(*******************************************\n);

printf(*[1]初始化链栈*\n);

printf(*[2]入栈*\n);

printf(*[3]出栈*\n);

printf(*[4]取栈顶元素*\n);

printf(*[0]退出系统??????*\n);

printf(*******************************************\n);

printf(请选择您想执行的功能：);

scanf(%d,select);

if(select==0)break;

switch(select){

case1:

top=initLinkStack();

printf(初始化栈成功！\n);

break;

case2:

printf(请输入入栈元素：);

scanf(%d,e);

push(top,e);

break;

case3:

pop(top,e);

printf(出栈元素为：%d\n,e);

break;

case4:

printf(栈顶元素为：%d\n,getTop(top));

break;