实验二--栈、队列的实现及应用

实验二栈、队列的实现及应用
实验课程名：数据结构与算法
专业班级：学号：姓名：
S->base = (SElemType *)malloc(STACK_INIT_SIZE*sizeof(SElemType));
if (!S->base)
{
printf("分配空间失败!\n");
return (ERROR);
}
S->top = S->base;
S->stacksize = STACK_INIT_SIZE;
printf("栈初始化成功！\n");
return (OK);
} //InitStack() end
/*取顺序栈顶元素*/
int GetTop(SqStack *S, SElemType *e) //GetTop() sub-function
{
if (S->top == S->base)
{
printf("栈为空!\n"); //if empty SqStack
return (ERROR);
}
*e = *(S->top - 1);
return (OK);
} //GetTop() end
/*将元素压入顺序栈*/
int Push(SqStack *S) //Push() sub-function
{
SElemType e;
if (S->top - S->base>S->stacksize)
{
S->base = (SElemType *)realloc(S->base, (S->stacksize +
STACKINCREMENT*sizeof(SElemType)));
if (!S->base)
{
printf("存储空间分配失败!\n");
return (ERROR);
}
S->top = S->base + S->stacksize;
S->stacksize += STACKINCREMENT;
}
fflush(stdin);//清除输入缓冲区，否则原来的输入会默认送给变量x
printf("请输入要入栈的元素的值:");
e = getchar();
*S->top++ = e;
return (OK);
} //Push() end
/* 将元素弹出顺序栈*/
int Pop(SqStack *S, SElemType *e) //Pop() sub-function
{
if (S->top == S->base)
{
printf("栈为空!\n");
return (ERROR);
}
*e = *--S->top;
return (OK);
} //Pop() end
void display(SqStack *s)
{
if (s->top == s->base)
printf("栈为空!\n");
else{
while (s->top != s->base)
{
s->top = s->top - 1;
printf("%c->", *(s->top));
}
}
printf("\n");
}
int main()
{
int choice;
SElemType e;
SqStack s;
do
{
printf("===============================\n");
printf(" 0:退出\n");
printf(" 1:初始化栈\n");
printf(" 2:入栈\n");
printf(" 3:出栈\n");
printf(" 4:读取栈顶元素\n");
printf(" 5:显示栈中元素\n");
printf("===============================\n");
printf("输入操作选择代码(0-5):");
scanf("%d", &choice);
while(choice<0 || choice>5) { printf("输入有误，请重新输入(0-5):"); scanf("%d", &choice); }
switch (choice)。