数据结构学习笔记-栈例子程序

#include <stdio.h>
#include <malloc.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 pS);
void push(PSTACK pS, int val);
bool pop(PSTACK pS, int *val);
void traverse(PSTACK pS);
void clear(PSTACK pS);

int main(void)
{
	STACK S;
	int val;

	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);
	if(pop(&S, &val))
		printf("pop stack success, pop value:%d\n",val);
	else
		printf("pop stack fail, pop value:%d\n",val);
	traverse(&S);
	clear(&S);
	traverse(&S);

	return 0;
}
void init(PSTACK pS)
{
	pS->pTop = (PNODE)malloc(sizeof(NODE));
	if(pS->pTop == NULL){
		printf("malloc failed!\n");
		exit(-1);
	} else {
		pS->pBottom = pS->pTop; 
		pS->pTop->pNext = NULL; 
	}
}
void push(PSTACK pS, int val)
{
	PNODE pNew = (PNODE)malloc(sizeof(NODE));
	if(pNew == NULL){
		printf("malloc failed!\n");	
		exit(-1);
	} else {
		pNew->data = val;	
		pNew->pNext = pS->pTop;
		pS->pTop = pNew;

	}
}
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 * val)
{
	if(empty(pS))
		return false;
	else {
		PNODE r;
		r = pS->pTop;
		pS->pTop = r->pNext;
		*val = r->data;
		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;
	}


}