数据结构角度进行出栈、入栈操作

#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 *);
void clear(PSTACK pS);


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


init(&S);
push(&S,1);
push(&S,2);
push(&S,3);


traverse(&S);
clear(&S);
traverse(&S);


if(pop(&S,&val))
{
printf("出栈成功，出栈元素为%d\n",val);
}
else
{
printf("出栈失败\n");
}




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->pBottom->pNext=NULL;
}


}


void push(PSTACK pS,int val)
{
PNODE pNew=(PNODE)malloc(sizeof(NODE));


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