...wd......wd......wd...實(shí)驗(yàn)?zāi)康模?〕掌握雙向線性鏈表的邏輯特征2〕熟練掌握帶頭結(jié)點(diǎn)的雙向鏈表的指針操作，能完成雙向鏈表的構(gòu)建，插入，刪除與顯示等復(fù)雜應(yīng)用。二．實(shí)驗(yàn)原理雙向鏈表的結(jié)點(diǎn)中有兩個(gè)指針域，其一指向直接后繼，另一指向直接前驅(qū)，在C語言中可描述如下：typedefstructDuLNode{ElemTypedata;structDuLNode*prior;structDuLNode*next;}DuLNode,*DuLinkList;雙向鏈表的操作和單鏈表類似。本實(shí)驗(yàn)利用函數(shù)以及指針處理雙向鏈表的知識(shí),首先建設(shè)四個(gè)函數(shù),creat,print,ListInsert_DuL,ListDelete_DuL分別實(shí)現(xiàn)對(duì)雙向鏈表的建設(shè),輸出,插入，刪除功能。還需建設(shè)GetElemP_DuL函數(shù)來輔助。然后將五個(gè)函數(shù)組織在一個(gè)C程序中,用main函數(shù)作主調(diào)函數(shù)。三．實(shí)驗(yàn)內(nèi)容1．首先建設(shè)一個(gè)帶頭結(jié)點(diǎn)的非空的雙向鏈表。建設(shè)函數(shù)creat，操作與建設(shè)線性鏈表類似，但需要修改兩個(gè)方向的指針。本實(shí)驗(yàn)以輸入6個(gè)學(xué)生的數(shù)據(jù)為例。2.建設(shè)函數(shù)GetElemP_DuL，得到第i個(gè)元素的位置指針。3．對(duì)鏈表進(jìn)展插入操作。建設(shè)函數(shù)ListInsert_DuL，輸入要插入的學(xué)生數(shù)據(jù)以及位置，調(diào)用函數(shù)GetElemP_DuL，插入成功返回1，否則返回0。4.對(duì)鏈表進(jìn)展刪除操作。建設(shè)函數(shù)ListDelete_DuL，輸入要?jiǎng)h除的學(xué)生位置，調(diào)用函數(shù)GetElemP_DuL，刪除成功返回1，否則返回0。5.對(duì)鏈表的結(jié)果進(jìn)展輸出與顯示。建設(shè)函數(shù)print，對(duì)鏈表進(jìn)展正向和反向的輸出。6.建設(shè)main函數(shù)，把以上五個(gè)函數(shù)整合到一個(gè)程序之中，當(dāng)輸入的數(shù)據(jù)不為0時(shí)可進(jìn)展屢次刪除，插入操作，并對(duì)每一次的結(jié)果進(jìn)展顯示。四．實(shí)驗(yàn)方法運(yùn)行環(huán)境：VisualC++6.0把所有程序思想寫成代碼，通過VisualC++編譯，得到結(jié)果，即運(yùn)行成功。本實(shí)驗(yàn)程序代碼：#include"stdio.h"#include"malloc.h"#defineNULL0#defineLENsizeof(structstudent)#defineOK1#defineERROR0structstudent{ intdata; structstudent*prior; structstudent*next;};intn;structstudent*creat(void){ structstudent*L; structstudent*p1,*p2; L=(structstudent*)malloc(LEN); L->next=NULL; L->prior=NULL; n=0; p1=p2=(structstudent*)malloc(LEN); scanf("%d",&p1->data); while(p1->data!=0) { n=n+1; if(n==1) {L->next=p1;p1->prior=L;} else { p2->next=p1; p2->next->prior=p2; } p2=p1; p1=(structstudent*)malloc(LEN); scanf("%d",&p1->data); } p2->next=L; L->prior=p2; return(L->next);}voidprint(structstudent*head){ structstudent*p; p=head; printf("正向輸出：\n"); if(head!=NULL) do{ printf("%d\n",p->data); p=p->next; }while(p!=head->prior); printf("反向輸出：\n"); if(p==head->prior) { p=p->prior; do{ printf("%d\n",p->data); p=p->prior; }while(p!=head->prior); }}structstudent*GetElemP_DuL(structstudent*L,inti){ structstudent*p; intj=1; p=L; while(j!=i) { p=p->next; j++; } returnp;}intListInsert_DuL(structstudent*L,inti,inte){ structstudent*p,*s; if(!(p=GetElemP_DuL(L,i))) returnERROR; if(!(s=(structstudent*)malloc(LEN)))returnERROR; s->data=e; s->prior=p->prior;p->prior->next=s; s->next=p; p->prior=s; n=n+1; returnOK;}intListDelete_DuL(structstudent*L,inti){ structstudent*p; inte; if(!(p=GetElemP_DuL(L,i))) returnERROR; e=p->data; p->prior->next=p->next; p->next->prior=p->prior; free(p); n=n-1; returnOK;}voidmain(){ structstudent*head; inti,e; printf("請(qǐng)輸入學(xué)生的數(shù)據(jù)：\n"); head=creat(); print(head); printf("請(qǐng)輸入要插入的位置以及數(shù)據(jù)：\n"); scanf("%d%d",&i,&e); while(e!=0) { if(ListInsert_DuL(head,i,e)==1) print(head); printf("請(qǐng)輸入要插入的位置以及數(shù)據(jù)：\n"); scanf("%d%d",&i,&e); } printf("請(qǐng)輸入要?jiǎng)h除的位置：\n"); scanf("%d",&i); while(i!=0) { if(L