实现栈（c语言）

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


/*
NODE为在堆中开辟的内存数据类型，用来存放数据
STACK为在栈中开辟的内存数据类型，用来存放栈顶和栈底的地址 
*/ 
//结构体
typedef struct Node{
	int data;
	struct Node * pNext;
	
}NODE, * PNODE; 


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

//函数声明 
void init(PSTACK pS);
void push(PSTACK pS, int val);
void traverse(PSTACK pS);
bool is_empty(PSTACK pS);
void pop(PSTACK pS, int * val);



int main(void)
{
	STACK S;
	int val;
	
	init(&S);
	push(&S, 1);
	push(&S, 7);
	push(&S, 6);
	push(&S, 5);
	push(&S, 8);
	push(&S, 9);
	printf("从栈顶到栈底：");
	traverse(&S); 
	pop(&S, &val);
	printf("从栈顶到栈底：");
	traverse(&S);
	printf("出栈元素为：%d", val);
	return 0;
	
}
//初始化 
void init(PSTACK pS)
{
	pS->pTop = (PNODE)malloc(sizeof(NODE));
	if(NULL == pS->pTop)
	{
		printf("内存分配失败！\n");
		
		exit(-1);
	}
	
	pS->pBottom = pS->pTop;
	pS->pTop->pNext = NULL;
	pS->pTop->data = 0;	
	
}
//压栈 
void push(PSTACK pS, int val)
{
	PNODE pNew = (PNODE)malloc(sizeof(NODE));
	pNew->pNext = pS->pTop;
	pNew->data = val;
	
	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");
}

bool is_empty(PSTACK pS)
{
	if(pS->pBottom == pS->pTop)
	{
		return true;
		
	}
	else
	{
		return false;
		
	}
}
//出栈 
void pop(PSTACK pS, int * val)
{
	if(is_empty(pS))
	{
		return;
		
	}
	else
	{
		PNODE r = pS->pTop;
		pS->pTop = pS->pTop->pNext;
		*val = r->data;
		free(r);
		r = NULL;
		
	}
}