单链表基本操作

对于单链表的基本操作有创建、销毁、插入、查找、删除、入栈、出栈等基本操作，代码实现如下(参考linux一站式学习)

/* linklist.h */ #ifndef LINKLIST_H #define LINKLIST_H typedef struct node *link; struct node{ unsigned char item; link next; }; link make_node(unsigned char item); void free_node(link p); link search(unsigned char key); void insert(link p); void delete(link p); void traverse(void (*visit)(link)); void destroy(void); void push(link p); link pop(void); #endif /*linklist.c*/ #include<stdlib.h> #include"linklist.h" static link head = NULL; link make_node(unsigned char item) { link p = malloc(sizeof *p); p->item = item; p->next = NULL; return p; } void free_node(link p) { free(p); } link search(unsigned char key) { link p; for(p = head; p; p = p->next) if(p->item == key) return p; return NULL; } void insert(link p) { p->next =head; head = p; } void delete(link p) { link pre; if(p == head){ head = p->next; return; } for(pre = head; pre; pre = pre->next) if(pre->next == p){ pre->next = p->next; return; } } void traverse(void (*visit)(link)) { link p; for(p = head; p; p = p->next) visit(p); } void destroy(void) { link q, p = head; head = NULL; while(p){ q = p; p = p->next; free_node(q); } } void push(link p) { insert(p); } link pop(void) { if(head == NULL) return NULL; else{ link p = head; head = head->next; return p; } } /*main.c*/ #include <stdio.h> #include "linklist.h" void print_item(link p) { printf("%d/n", p->item); } int main(void) { link p = make_node(10); insert(p); p = make_node(5); insert(p); p = make_node(50); insert(p); p = search(5); delete(p); free_node(p); traverse(print_item); destroy(); p = make_node(100); push(p); p = make_node(200); push(p); p = make_node(250); push(p); while(p = pop()) { print_item(p); free_node(p); } return 0; }