C語言實現鏈表 - c語言程序開發技術文章 - 紅黑聯盟
http://www.BkJia.com/kf/201109/104029.html
<stdio.h><stdlib.h><conio.h>
NULL 0
student *prior;
student *
student * student *head;
student * student *= ( student*)malloc((=->next =,&(x!== ( student*)malloc((->num =->next =->next =->prior ==,&
print( student * student *= head->(p==(p!=, p->= p->
del( student * student * student * j=, &(i<, &=(j<=i- && p!== p->++(p===->prior->next = p->->next->prior = p->= p->
insert( student * student * student *q = j = = ( student*)malloc((, &p->,p->, &(i<, &(j<=i- && q->next!== q->++(q->next==NULL && j!=->next =->prior =->next =->prior->next =->prior = q->->next =->prior =
search( student * student * number, i=, j=, &= head->(p!=(p->num=== = p->++(j==
student * student * student * student * i = * file[] = ((fp=fopen(file, ))=== ( student*)malloc((*== ( student*)malloc((*(fread(p1, (*p1), , fp)==++->next ==->next == ( student*)malloc((*(i==
savefile( student* student ** file[] = ((fp=fopen(file,))=== head->(p1!=( student), = p1->
a= student *=
(, & : insert(la); : del(la); : search(la); : filein(); : savefile(la); : print(la); : showMenu(); : exit(: printf();