#include "stdio.h"
#include "stdlib.h"
int Max_SIZE=100;
typedef struct LinkStackNode
{
int data;
LinkStackNode *next;
}LinkStackNode;
typedef struct LinkStack
{
LinkStackNode *top;
int length;
}LinkStack;
LinkStack *initialize_stack()//链栈的初始化
{
LinkStack *p = (LinkStack *) malloc(sizeof(LinkStack));
p->length = 0;
p->top = NULL;
return p;
}
int Isempty(LinkStack *p)//判断栈是否为空
{
if(p->length==0)
{
printf("栈为空\n");
return 1;
}
else
{
printf("栈不为空\n");
return 0;
}
}
int Isenough(LinkStack *p)//判断栈满
{
if(p->length==Max_SIZE) {
print
链栈的基本操作(初始化,出栈,入栈,清空,销毁,取栈顶元素,遍历)
最新推荐文章于 2022-05-07 17:27:38 发布