数据结构链栈实现
#include<iostream>
#include<cstdlib>
using namespace std;
typedef int ElemType;
typedef struct linknode
{
ElemType data;
struct linknode *next;
}LinkStNode;
void InitStack(LinkStNode *&s)
{
s=(LinkStNode *)malloc(sizeof(LinkStNode));
s->next=NULL;
}
void DestroyStack(LinkStNode *&s)
{
LinkStNode *pre=s,*p=s->next;
while(p!=NULL)
{
free(pre);
pre=p;
p=p->next;
}
free(pre);
}
bool StackEmpty(LinkStNode *s)
{
return s->next==NULL;
}
void Push(LinkStNode *s,ElemType e)
{
LinkStNode *p;
p=(LinkStNode *)malloc(sizeof(LinkStNode));
p->data=e;
p->next=s->next;
s->next=p;
}
bool Pop(LinkStNode *s,ElemType &e)
{
LinkStNode *p;
if(s->next==NULL)return false;
p=s->next;
e=p->data;
s->next=p->next;
free(p);
return true;
}
bool GetTop(LinkStNode *s,ElemType &e)
{
if(s->next==NULL)return false;
e=s->next->data;
return true;
}
int main()
{
LinkStNode *st;
ElemType e;
InitStack(st);
Push(st,10);
Push(st,20);
Pop(st,e);
cout<<e<<endl;
GetTop(st,e);
cout<<e<<endl;
return 0;
}