数据结构——顺序栈的基本运算

#include<stdio.h>
#include<malloc.h>
#define MaxSize 100
typedef char ElemType;
typedef struct
{
	ElemType data[MaxSize];
	int top;
}SqStack;
void InitStack(SqStack *&s)//初始化顺序栈 
{
	s=(SqStack*)malloc(sizeof(SqStack));
	s->top=-1;
}
void DestroyStack(SqStack *&s)//销毁顺序栈 
{
	free(s);
}
bool StackEmpty(SqStack *s)//判断栈是否为空 
{
	return(s->top==-1);
}
bool Push(SqStack *&s,ElemType e)//进栈 
{
	if(s->top==MaxSize-1)		//栈满的情况，即栈上溢出 
		return false;
	s->top++;
	s->data[s->top]=e;
	return true;
}
bool Pop(SqStack *&s,ElemType &e)//出栈 
{
	if(s->top==-1)				//栈为空时，即下栈溢出 
		return false;
	e=s->data[s->top];
	s->top--;
	return true;
}
bool GetTop(SqStack *s,ElemType &e)//取栈顶元素 
{
	if(s->top==-1)				   //栈为空时，即下栈溢出 
		return false;
	e=s->data[s->top];
	return true;
}
 

#include"sqstack.cpp"
int main()
{
	ElemType e;
	SqStack *s;
	printf("顺序栈s的基本运算如下：\n");
	printf("(1)初始化栈s\n");
	InitStack(s);
	printf("(2)栈为%s\n",(StackEmpty(s)?"空":"非空"));
	printf("(3)依次进栈元素a，b，c，d，e\n");
	Push(s,'a');
	Push(s,'b');
	Push(s,'c');
	Push(s,'d');
	Push(s,'e');
	printf("(4)栈为%s\n",(StackEmpty(s)?"空":"非空"));
	printf("(5)出栈序列；");
	while(!StackEmpty(s))
	{
		Pop(s,e);
		printf("%c",e);
	}
	printf("\n");
	printf("(6)栈为%s\n",(StackEmpty(s)?"空":"非空"));
	printf("(7)释放栈\n");
	DestroyStack(s);
	return 1;
}

标签：顺序,return,运算,SqStack,ElemType,top,printf,Push,数据结构
来源： https://blog.csdn.net/qq_52479948/article/details/122408458