1、/*雙鏈表的操作:查詢、刪除、顯示、插入。*雙向鏈表克服單向鏈表向前查找結點需要執(zhí)行時間O(n)的缺點*2008.1.17*/#include#include#include#defineN10typedefstructnode*ptNode;structnodecharname20;ptNodelLink,rLink;/*雙鏈表的結構定義*/*雙鏈表的創(chuàng)建*/ptNodeCreat(intn)ptNodehead,ptr,newnode;inti;if(head=(ptNode)malloc(sizeof(node)=NULL)printf(cannotfindspace!n);exit(0

2、);head-name0=0;/頭結點初始化head-lLink=NULL;head-rLink=NULL;ptr=head;for(i=0;irLink=newnode;/連接新結點printf(Pleaseinputthe%dmansname:,i+1);scanf(%s,newnode-name);newnode-lLink=ptr;/定義newnode的連接關系newnode-rLink=NULL;ptr=newnode;/endforhead-lLink=newnode;ptr-rLink=head;return(head);/*查找名字的位置*/ptNodeSearch(ptNod

3、ehead,char*pEle)ptNodeptr;char*pTemp;ptr=head-rLink;while(ptr!=head)/以是否回到頭結點為結束條件pTemp=ptr-name;/pTemp暫存結點的名字地址if(strcmp(pTemp,pEle)=0)return(ptr);elseptr=ptr-rLink;指向下一結點printf(cannotfinddata!n);returnNULL;/在選定名字前插入voidInsert(ptNodehead,char*prior,char*insertEle)ptNodeptr,newnode;if(ptr=Search(hea

4、d,prior)=NULL)printf(Cantfindthedatatoinsert!n);exit(0);if(newnode=(ptNode)malloc(sizeof(node)=NULL)printf(Cantarrangememoryspace!n);exit(0);strcpy(newnode-name,insertEle);給新結點加載值newnode-lLink=ptr-lLink;前指針指向前結點，先處理以新結點為中心前后關系newnode-rLink=ptr;新結點后指針指向定位結點(ptr-lLink)-rLink=newnode;/前結點的由指針指向新結點ptr-l

5、Link=newnode;/*打印輸出*/voidPrint(ptNodehead)ptNodeptr;ptr=head-rLink;printf(nNowthedoublelistis:n);while(ptr!=head)printf(%s,ptr-name);ptr=ptr-rLink;printf(n);/*刪除*/voidDelete(ptNodeptr)(ptr-rLink)-lLink=ptr-lLink;/(ptr-rLink)-lLink下一結點的左指針被賦前指針(ptr-lLink)-rLink=ptr-rLink;free(ptr);/*主函數*/voidmain(voi

6、d)intnumber;charstudName20;charinsertName20;ptNodehead,searchpoint;number=N;puts(Pleaseinputthesizeofthelist:);scanf(%d,&number);head=Creat(number);Print(head);printf(nPleaseinputthenamewhichyouwanttofind:n);scanf(%s,studName);searchpoint=Search(head,studName);printf(thenameyouwanttofindis:%sn,searchpoint-name);Delete(searchpoint);Print(head);printf(Beforewhichelementdoyouwanttoinsert:n);scanf(%s,studName);printf(Enterthestu