数据结构上机作业---栈的基本运算
#include<malloc.h>
#define MaxSize 100
typedef char ElemType;
using namespace std;
typedef struct linknode
{
ElemType data;
struct linknode*next;
}LiStack;
void InitStack(LiStack*&s)
{
s=(LiStack*)malloc(sizeof(LiStack));
s->next=NULL;
}
bool DestroyStack(LiStack*&s)
{
LiStack*p=s,*q=s->next;
while (q!=NULL)
free(p);
p=q;
q=p->next;
}
free(p);
}
bool StackEmpty(LiStack*s){
return (s->next==NULL);
}
bool push(LiStack*&s,ElemType e)
{
LiStack*P;
p=(LiStack*)malloc(sizesof(LiStack));
p->data=e;
p->next=s->next;
s->next=p;
}
bool Pop(LiStack*&s,ElemType&e)
{
Listack*p;
if(s->next==NULL)
return false;
p=s->next;
e=p->data;
s->next=p->next;
free(p);
return true;
}
bool GetTop(LiStack*&s.ElemType&e)
{
if(s->next==NULL)
return false;
e=s->next->data;
return true;
}
int main()
{
ElemType e;
LiStack *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"(StcakEmpty(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 0;
}