数据结构C语言版-严蔚敏 笔记及源码（4）栈的链式表示和实现

栈的链式表示和实现

栈的链式表示和线性表的链式表示是一样的，所以实现起来也非常的容易

链栈的基本操作有：
InitStack(&S) #栈的初始化
Push(&S,e) #压栈
Pop(&S,&e) #出栈
DestortStack(&S) #销毁栈
StackLength(S) #获取栈的长度
StackTraverse(S,visit()) #以visis()规则遍历栈

运行结果：

直接上代码（以下代码可以直接复制运行）

#include<stdio.h>
#include<stdlib.h>
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1 
#define OVERFLOW -2
typedef int ElemType;  
typedef int Status;  

typedef struct Stack_Node{
	ElemType data;
	struct Stack_Node *next;
}StackNode, *LinkStackNode;

//1.栈的初始化
StackNode *StackInit(void){
  LinkStackNode top;
  top = (StackNode *)malloc(sizeof(StackNode));
  top -> next = NULL;
  return top;
}

//2.压栈
Status Push(LinkStackNode &top,ElemType e){
  StackNode *p;
  p = (StackNode *)malloc(sizeof(StackNode));
  if(!p) return ERROR;
  p -> data = e;
  p -> next = top -> next;
  top -> next = p;
  return OK;
}

//3.出栈
Status Pop(LinkStackNode &top,ElemType &e){
	StackNode *p;
	if(top -> next == NULL) return ERROR;  //空栈
	p = top -> next;
	e = p -> data;
	top -> next = p -> next;
	free(p);
	return OK; 
}

//4.DestoryStack
Status DestoryStack(LinkStackNode &top){
	LinkStackNode pre,p;
	if(top -> next == NULL) return ERROR;  //空栈
	pre = top -> next;
	while(pre){
		p = pre -> next;
		free(pre);
		pre = p;
	}
	top -> next = NULL;
	return OK;
}

//5.StackLength
Status StackLength(LinkStackNode top){
	LinkStackNode p;
	int len = 0;
	if(top -> next == NULL) return len;  //空栈 
	p = top;
	while(p -> next != NULL){
		p = p -> next;
		len++;
	}
	return len;
} 

//6.StackTraverse
Status StackTraverse(LinkStackNode top,Status(visit)(ElemType)){
	
	if(top -> next == NULL) return ERROR;
	
	LinkStackNode p = top;
	while(p -> next != NULL){
		p = p -> next;
		visit(p -> data);
	}
}

int PrintElem(ElemType e){
 	printf("  %d  |\n",e);
 	printf("-----\n");
}


main(){
	int i,len,flag;
	StackNode *S;
	printf("------------初始化栈-------------\n");
	S = StackInit();
	if(S) printf("初始化成功\n");
	else printf("初始化失败\n");

	printf("------------压栈 + 获取长度-------------\n");
	Push(S,2);
	Push(S,3);
	len = StackLength(S);
	printf("当前长度为: %d\n",len);
	
	printf("------------遍历栈-------------\n");
	
	StackTraverse(S,PrintElem);
	
	printf("------------出栈-------------\n");
	Pop(S,i);
	printf("%d\n",i);
	
	printf("------------销毁栈-------------\n");
	flag = DestoryStack(S);
	if(flag) printf("yes\n");
	else printf("No\n");
	flag = Pop(S,i);
	if(flag) printf("出栈成功，值是%d\n",i);
	else printf("空栈\n");
	
	
}