栈清空程序演示

#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;

void init(PSTACK);
void push(PSTACK, int);
void traverse(PSTACK);

bool pop(PSTACK, int *p);
bool empty(PSTACK ps);   //判空


void clear(PSTACK ps);   //清空

int main(void){

	STACK s;           //等价于struct Stack
	init(&s);            //初始化
	push(&s,1);            //压栈 
	push(&s, 2);
	push(&s, 3);
	push(&s, 4);
	push(&s, 5);
	push(&s, 6);
	push(&s, 7);
	
	traverse(&s);      //遍历输出
	 

	//清空栈
	clear(&s);
	traverse(&s);      //遍历输出

	
	int val;   //保存出栈的元素
	//出栈一个元素
	if (pop(&s, &val)) {
		printf("出栈成功，出栈的元素是%d\n", val);
	}else {
		printf("出栈失败，出栈的元素是%d\n", val);
	}
	traverse(&s);      //遍历输出

   

	while (true){	}
	return 0;
}

//初始化造出一个空栈
void init(PSTACK