使用链表实现数据结构中的栈

#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
typedef struct Node{
	int data;
	struct Node * pNext;
}NODE,*PNODE;

typedef struct Stack{
	PNODE pTop;
	PNODE pBottom;
}STACK,*PSTACK;

void init(PSTACK S);//初始化栈
void push(PSTACK pS,int val);//向栈中压入元素
void traverse(PSTACK pS);//遍历栈
bool is_empty(PSTACK pS);//判断栈是否为空
bool pop(PSTACK pS,int *pVal);//出栈
void clear(PSTACK pS);//将栈中的元素清空
int main(){
	STACK S;
	int val;
	
	init(&S);//初始化栈
	push(&S,1);//向栈中压入元素
	push(&S,2);
	push(&S,3);
	push(&S,4);
	traverse(&S);
	if(pop(&S,&val)){
		printf("出栈成功，出栈的元素是%d\n",val);
	}else{
		printf("出栈失败\nf");
	}
	traverse(&S);
	clear(&S);
	traverse(&S);
	
	push(&S,1);
	traverse(&S);
}

void clear(PSTACK pS){
	if(pS==NULL){
		return;
	}
	PNODE p;
	while(pS->pTop!=pS->pBottom){
		p=pS->pTop;
		pS->pTop=pS->pTop->pNext;
		free(p);
		p=NULL;
	}
}

//判断栈是否为空
bool is_empty(PSTACK pS){
	if(pS->pTop==pS->pBottom){
		return true;
	}else{
		return false;
	}
}
//出栈,将栈顶指针下移一个
bool pop(PSTACK pS,int *pVal){
	if(is_empty(pS)){
		return false;
	}else{
		//将当前栈顶节点的值赋值给pVal所指向的内存空间
		*pVal=pS->pTop->data;
		PNODE p;
		p=pS->pTop;
		pS->pTop=pS->pTop->pNext;
		free(p);
		p==NULL;
		return true;
	}
}

//遍历栈
void traverse(PSTACK pS){
	PNODE p;
	p=pS->pTop;//将栈顶指针保存在一个新指针中。
	//注意在遍历时不能改变栈顶和栈低指针
	while(p!=pS->pBottom){
		printf("%d\n",p->data);
		p=p->pNext;
	}
}
//向栈中压入元素
void push(PSTACK pS,int val){
	//因为每一个节点都是由malloc申请的，所以栈的内存空间不是连续的
	PNODE pNew = (PNODE)malloc(sizeof(NODE));//先申请一个新的节点
	pNew->data=val;
	pNew->pNext = pS->pTop;
	pS->pTop=pNew;
	return;
}

//初始化栈
void init(PSTACK pS){
	pS->pTop=(PNODE)malloc(sizeof(NODE));
	if(pS->pTop==NULL){
		printf("动态内存分配失败\n");
		exit(-1);
	}else{
		pS->pBottom=pS->pTop;
		pS->pTop->pNext=NULL;
	}
}