数据结构——链式栈实现时用的结构体

---

前言

链式栈插入操作和删除操作均在链表头部进行，链表尾部就是栈底，栈顶指针就是头指针

提示：以下是本篇文章正文内容，下面案例可供参考

一、链式栈？

数据结构——顺序栈
链式栈插入操作和删除操作均在链表头部进行，链表尾部就是栈底，栈顶指针就是头指针

二、写出链式栈实现时用的结构体

1.创建链式栈

代码如下（示例）：

typedef int data_t;
 
typedef struct node {
    data_t data;
    struct node *next;
}listnode, *linkstack;
 
linkstack stack_create();
int stack_push(linkstack s, data_t value);
data_t stack_pop(linkstack s);
int stack_empty(linkstack s);
data_t stack_top(linkstack s);
linkstack stack_free(linkstack s);

2.写出链式栈各个功能的代码块

代码如下（示例）：

linkstack stack_create() {
    linkstack s;
 
    s = (linkstack)malloc(sizeof(listnode));
    if (s == NULL) {
        printf("malloc failed\n");
        return NULL;
    }
    s->data = 0;
    s->next = NULL;
 
    return s;
}
 
int stack_push(linkstack s, data_t value) {
    linkstack p;
 
    if (s == NULL) {
        printf("s is NULL\n");
        return -1;
    }
 
    p = (linkstack)malloc(sizeof(listnode));
    if (p == NULL) {
        printf("malloc failed\n");
        return -1;
    }
    p->data = value;
    //p->next = NULL;
    p->next = s->next;
    s->next = p;
 
    return 0;
}
 
data_t stack_pop(linkstack s) {
    linkstack p;
    data_t t;
 
    p = s->next;
    s->next = p->next;
 
    t = p->data;
 
    free(p);
    p =NULL;
 
    return t;
}
 
int stack_empty(linkstack s) {
    if (s == NULL) {
        printf("s is NULL\n");
        return -1;
    }
 
    return (s->next == NULL ? 1 : 0);
}
 
data_t stack_top(linkstack s) {
    return (s->next->data);
}
 
linkstack stack_free(linkstack s) {
    linkstack p;
 
    if (s == NULL) {
        printf("s is NULL\n");
        return NULL;
    }
 
    while (s != NULL) {
        p = s;
        s = s->next;
        printf("free:%d\n", p->data);
        free(p);
    }
 
    return NULL;
}

测试链式栈

int main(int argc, const char *argv[])
{
    linkstack s;
 
    s = stack_create();
    if (s == NULL) 
        return -1;
 
    stack_push(s, 10);
    stack_push(s, 20);
    stack_push(s, 30);
    stack_push(s, 40);
 
#if 0
    while (!stack_empty(s)) {
        printf("pop:%d\n", stack_pop(s));
    }
#endif
 
    s = stack_free(s);
     
    return 0;
}