栈的单链表实现

栈的单链表实现

//listack.h
#include<stdio.h>
#include<malloc.h>
typedef char 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 * p = s->next;
	while(p != NULL){
		free(s);	//依次free
		s = p;
		p = p->next;
	}
	free(s);
}
//判断栈是否为空
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;
}

//liststack.cpp
#include"listack.h"
int main()
{
	ElemType e;
	LinkStNode *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）释放栈");
	DestroyStack(s);
	getchar();
	return 0;
}