数据结构之C语言实现链栈

typedef struct Linknode{
  ElemType data;  //数据域
  struct Linknode *next;  //指针域
} *LiStack; //栈类型定义

#include "stdlib.h"
#include "stdio.h"
#include "stdbool.h"

typedef struct LinkNode {
    int data;  //数据域
    struct LinkNode *next;  //指针域
} *LiStack, LinkNode; //栈类型定义



bool init(LiStack *stack) {
    *stack = (LiStack) malloc(sizeof(LinkNode));
    if (NULL == *stack) {
        return false;
    }
    //头结点的data为-1，-1为特别标识
    (*stack)->data = -1;
    (*stack)->next = NULL;
    return true;
}


bool push(LiStack stack, int data) {
    if (NULL == stack) {
        return false;
    }
    //先做一个链表结点出来
    LinkNode *cur = malloc(sizeof(LinkNode));
    cur->data = data;
    //开始换位
    cur->next = stack->next;
    stack->next = cur;
    return true;
}


bool pull(LiStack stack, int *e) {
    if (stack == NULL||stack->next==NULL) {
        return false;
    }
    //赋值操作
    *e = stack->next->data;
    //链表删除结点
    LinkNode *next = stack->next;
    stack->next = next->next;
    return true;
}

int main() {
    LiStack liStack;
    int e = -1;
    init(&liStack);
    printf("%dn", liStack->data);
    pull(liStack, &e);
    printf("%dn", e);
    push(liStack, 1);
    pull(liStack, &e);
    printf("%dn", e);
    push(liStack, 2);
    push(liStack, 3);
    pull(liStack, &e);
    printf("%dn", e);
    pull(liStack, &e);
    printf("%dn", e);
    pull(liStack, &e);
    printf("%dn", e);
    return 1;
}