單鏈表基本操作

對於單鏈表的基本操作有建立、銷毀、插入、尋找、刪除、入棧、出棧等基本操作，代碼實現如下(參考linux一站式學習)

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