单链表的建立、插入和删除

单链表的建立、插入和删除单链表的建立插入删除#includevstdio.h>#includevstdlib.h>/*线性表*/structTLink{intdata;structTLink*next;};/*endstructTLink*//*生成新元素*/structTLink*new_item(intnumber){structTLink*r=0;r=(structTLink*)malloc(sizeof(structTLink));r->data=number;r->next=0;returnr;}/*endnew_item*//*在线性表中查询数据*/structTLink*lookup(structTLink*root,intnumber){structTLink*h=root;while(h){if(h->data==number)returnh;h=h->next;}/*endlookup*/return0;}/*在线性表中追加一个数据*/voidappend(structTLink**root,intnumber){structTLink*r=0,*n=0;if(!root)return;/*不记录重复元素*/if(lookup(*root,number))return;/*如果表为空则新建表*/r=*root;if(!r){*root=new_item(number);return;}/*endif*//*为保证为有序线性表，如果数据比表头还小则作为表头*/if(number<r->data){n=new_item(number);n->next=r;*root=n;return;}/*endif*//*在有序线性表中查找位置插入元素*/while(r){n=r->next;/*如果已经是表尾则直接追加*/if(!n){n=new_item(number);r->next=n;return;}/*endif*//*在中央某处插入*/if(number<n->data){r->next=new_item(number);r->next->next=n;return;}/*endif*/r=n;}/*endwhile*/}/*endappend*//*打印有序线性表*/voidprint(structTLink*root){structTLink*r=root;printf(”【")；while(r){printf("%d",r->data);r=r->next;}/*endwhile*/printf("\b】\n”);}/*endprint*//*将有序线性表hl合并至有序线性表hO,并销毁线性表hi*/voidmerge(structTLink**hO,structTLink**hi){structTLink*h=0,*k=0;if(!h0||!h1)return;h=*h1;while(h){append(hO,h->data);k=h;h=h->next;free(k);}/*endh*/hi=0;}intmain(void){inti=0;structTLink*x=0,*y=0;inta[]={8,439,5,1};intb[]={7,2,1,560};printf("原数据为：\n数组A：【")；for(i=0;i<6;i++){printf("%d",a[i]);append(&x,a[i]);}/*next*/printf("\b】\n数组B：【")；for(i=0;i<6;i++){printf("%d",b[i]);append(&y,b[i]);}/*next*/printf("\b】\n转换为有序线