基于链表的堆栈实现

/* 基于链表的堆栈 */
#ifndef _SL_H
#define _SL_H
#include <sys/types.h>
/* 节点 */
typedef struct StackNode {
int               data; /* 数据 */
struct StackNode* next; /* 后指针 */
}   STACK_NODE;
/* 堆栈 */
typedef struct Stack {
STACK_NODE* top; /* 栈顶 */
}   STACK;
/* 初始化为空堆栈 */
void stack_init (STACK* stack);
/* 释放剩余节点并恢复到初始状态 */
void stack_deinit (STACK* stack);
/* 判断是否空 */
int stack_empty (STACK* stack);
/* 压入 */
void stack_push (STACK* stack, int data);
/* 弹出 */
int stack_pop (STACK* stack);
/* 栈顶 */
int stack_top (STACK* stack);
/* 数量 */
size_t stack_size (STACK* stack);
#endif /* _SL_H */

/* 基于链表的堆栈 */
#include <stdlib.h>
#include "sl.h"
/* 创建节点 */
static STACK_NODE* create_node (int data, STACK_NODE* next) {
STACK_NODE* node = malloc (sizeof (STACK_NODE));
node->data = data;
node->next = next;
return node;
}
/* 销毁节点 */
static STACK_NODE* destroy_node (STACK_NODE* node) {
STACK_NODE* next = node->next;
free (node);
return next;
}
/* 初始化为空堆栈 */
void stack_init (STACK* stack) {
stack->top = NULL;
}
/* 释放剩余节点并恢复到初始状态 */
void stack_deinit (STACK* stack) {
while (stack->top)
stack->top = destroy_node (stack->top);
}
/* 判断是否空 */
int stack_empty (STACK* stack) {
return ! stack->top;
}
/* 压入 */
void stack_push (STACK* stack, int data) {
stack->top = create_node (data, stack->top);
}
/* 弹出 */
int stack_pop (STACK* stack) {
int data = stack->top->data;
stack->top = destroy_node (stack->top);
return data;
}
/* 栈顶 */
int stack_top (STACK* stack) {
return stack->top->data;
}
/* 数量 */
size_t stack_size (STACK* stack) {
size_t size = 0;
STACK_NODE* node = NULL;
for (node = stack->top; node; node = node->next)
++size;
return size;
}

/* 基于链表的堆栈 */
#include <stdio.h>
#include "sl.h"
/* 测试用例 */
int main (void) {
STACK stack;
stack_init (&stack);
int i;
for (i = 0; i < 10; ++i)
stack_push (&stack, i);
while (! stack_empty (&stack))
printf ("%d\n", stack_pop (&stack));
stack_deinit (&stack);
return 0;
}