栈的基本操作（创建栈，压栈，出栈，遍历栈，清空栈，判断是否为空栈）

#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>

typedef struct Node{
	int data;
	struct Node *pNext;
}NODE,* PNODE;

typedef struct Stack{
	PNODE pTop;
	PNODE pBottom;
}STACK,* PSTACK;//PSTACK 等价于struct STACK * 

void init(PSTACK);
void push(PSTACK,int );
void traverse(PSTACK); 
bool pop(PSTACK,int *);
void clear(PSTACK);
int main(){
	STACK S;//STACK 等价于 struct Stack 
	
	int val;
	init(&S);//目的造出一个空栈 
	push(&S, 1); //压栈 
	push(&S, 2);
	push(&S, 3);
	push(&S, 4);
	traverse(&S);//遍历输出 
//	clear(&S);
//	traverse(&S);//遍历输出 
	
	if(pop(&S,&val)){
		printf("出栈成功，出栈元素是%d\n",val);
	} else{
		printf("出栈失败！\n");
	}
	return 0;
	
} 
void init(PSTACK pS){
	pS->pTop=(PNODE)malloc(sizeof(NODE));
	if(NULL==pS->pTop){
		printf("动态内存分配失败！\n");
		exit(-1);
	}else{
		pS->pBottom=pS->pTop;
		pS->pTop->pNext=NULL;//pS->pButtom->pNext=NULL;
	}
}
void push(PSTACK pS,int val){
	PNODE pNew=(PNODE)malloc(sizeof(NODE));
	pNew->data=val;
	pNew->pNext=pS->pTop;//pS->pTop不能改成pS->Buttom
	pS->pTop=pNew;
	return;
}

void traverse(PSTACK pS){
	PNODE p=pS->pTop;
	
	while(p!=pS->pBottom){
		printf("%d  ",p->data);
		p=p->pNext;
	}
	printf("\n");
	
	return;
}
bool empty(PSTACK pS){
	if(pS->pTop==pS->pBottom)
		return true;
		else
		return false;
}
//把pS所指向的栈出栈一次，并把出栈的元素存入pVal所指向的变量中，如果出栈失败，返回false，否则返回true 
bool pop(PSTACK pS,int *pVal){
	if(empty(pS)){//pS本身存放的就是S的地址 
		return false;
	} else{
		PNODE r=pS->pTop;
		*pVal=r->data; 
		pS->pTop=r->pNext;
		free(r);
		r=NULL;
		
		return true;
	} 

} 
//clear 清空 
void clear(PSTACK pS){
	if(empty(pS)){
		return ;
	}else{
		PNODE p=pS->pTop ;
		PNODE q=NULL;
		
		while(p!=pS->pBottom){
			q=p->pNext;
			free(p);
			p=q;
		}
		pS->pTop=pS->pBottom;
	}
	
}

Love is patient, love is kind. It does not envy, it does not boast, it is not proud. (The Bible)
爱是恒久忍耐，又有恩慈；爱是不嫉妒，爱是不自夸，不张狂。——《圣经》

向林
2020年2月16日于重庆城口
好好学习，天天向上,终有所获