C语言实现线性表之栈算法

以下为代码：

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

typedef struct LinkList
{
    int data;
    struct LinkList * next;
}NODE, * PNODE;

typedef struct Stact
{
    PNODE top;
    PNODE pbottom;
}STACK,* PSTACK;

void init(PSTACK p);
bool Push(PSTACK p,int val);
bool Pop(PSTACK p);
void Traverse(PSTACK p);
bool IsEmpty(PSTACK p);

int main(int argc, char *argv[])
{
    STACK stack;
    init(&stack);    
    Pop(&stack);
    Push(&stack,1);    
    Push(&stack,2);    
    Push(&stack,3);    
    Push(&stack,4);    
    Push(&stack,5);    
    Traverse(&stack);
    Pop(&stack);
    Traverse(&stack);
    return 0;
}
void init(PSTACK p){
    p->top =(PNODE)malloc(sizeof(NODE));
    if(NULL==p->top){
        printf("内存分配失败");
        exit(-1);
    }
    p->pbottom=p->top;
    p->top->next=NULL;
}
bool Push(PSTACK p,int val){
    PNODE pnode=(PNODE)malloc(sizeof(NODE));
    if(NULL==pnode){
        printf("内存分配失败");
        return false;    
    }
    pnode->data=val;
    pnode->next=p->top;
    p->top=pnode; 
    return true;
}
bool Pop(PSTACK p){
    if(IsEmpty(p)){
        printf("栈已空
");
        return false;
    }
    PNODE pnode=p->top;
    p->top=p->top->next;
    free(pnode);
}
void Traverse(PSTACK p){
    PNODE pnode=p->top;
    while(pnode!=p->pbottom){
        printf("%d ",pnode->data);
        pnode=pnode->next;
    }
    printf("
");
}
bool IsEmpty(PSTACK p){
    if(p->top==p->pbottom)
    {
        return true;
    }
    return false;
}

以下是运行结果：