栈(2)-栈的创建及操作

#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
#define bool int
#define true 1
#define false 0

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

typedef struct Stack{
	PNODE pTop;
	PNODE pBottom;
}STACK,*PSTACK;
void init(PSTACK);
void push(PSTACK,int);
void traverse(PSTACK);
bool pop(PSTACK,int *);
bool empty(PSTACK);
void clear(PSTACK);

int main(void)
{
	STACK S; 
	int val;
	init(&S);//初始化一个空栈
	push(&S,1);//压栈
	push(&S,2);
	push(&S,3);
	push(&S,4);
	push(&S,5);
	traverse(&S);//遍历输出
	
	clear(&S);
	traverse(&S);//遍历输出
	
	if(pop(&S,&val)){
		printf("出栈成功，出栈的元素是%d\n",val);
	}
	else{
		printf("出栈失败！\n");
	}

	traverse(&S);//遍历输出


	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->pBottom->pNext=NULL
	}
	return;
}
void push(PSTACK pS,int val)
{
	PNODE pNew=(PNODE)malloc(sizeof(NODE));
	pNew->data=val;
	pNew->pNext=pS->pTop;//pS->pTop不能改为pS->Bottom
	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;
}

bool pop(PSTACK pS,int * pVal)//把pS所指向的栈出栈一次，并把出栈的元素存入pVal形参所指向的变量中，如果出栈失败返回false
{
	PNODE r;
	if(empty(pS)){//pS本身存放的就是S的地址
		
		return false;
	}
	else{
		r=pS->pTop;
		*pVal=r->data;
		pS->pTop=r->pNext;
		free(r);
		r=NULL;
		return true;
	}
}
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;
	}
}