数据结构：栈stack（链表实现）

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

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

typedef struct stack
{
    PNODE pTop;
    PNODE pBottom;
}STACK,*PSTACK;  //这个结构体就是存放两个Node的指针

void init(PSTACK);
void push(PSTACK,int);
void traverse(PSTACK);
bool pop(PSTACK pS,int *pVal); //出栈
void clear(PSTACK);  //清空

int main()
{
    STACK S;  //STACK 等价于 struct Stack   此时只是开辟了一块空间放两个Node的指针，但是并没有生成一个栈
              //只有将 S 中 pTop和pBottom 指向同一个头节点，才是生成了一个空的栈

    init(&S);  //构造一个空的栈，使 pTop和pBottom 指向该空栈头节点
    push(&S,1);  //压栈
    push(&S,2);
    push(&S,3);
    push(&S,4);
    push(&S,5);
    traverse(&S);

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

    int val;
    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");
    }else
    {
        pS->pBottom = pS->pTop;
        pS->pBottom->pNext = NULL;
    }
    return;
}

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

    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\n",p->data);
        p = p->pNext;
    }
    return;
}

bool empty(PSTACK pS)
{
    if(pS->pTop == pS->pBottom)
        return true;
    else
        return false;
}

bool pop(PSTACK pS,int *pVal)
{
    if(empty(pS))   //pS本身存放的就是S的地址了
        return false;
    else
    {
        PNODE p = pS->pTop;
        *pVal = p->data;
        pS->pTop = p->pNext;
        free(p);
        p = 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;
        return;
    }

}