數(shù)據(jù)結(jié)構(gòu)習(xí)題集（李冬梅 第2版）C語言版源程序-算法2-9

1、ttinclude 件include using namespace std;函數(shù)結(jié)果狀態(tài)代碼define OK 14define ERROR 0 /define OVERFLOW -2/Status是函數(shù)的返回值類型，其值是函數(shù)結(jié)果狀態(tài)代碼typedef int Status;typedef struct DuLNode(int data;struct DuLNode *next;struct DuLNode *prior;DuLNode, *DuLinkList;的指針類型Status InitList(DuLinkList &L);Status DestroyList(DuLinkLis

2、t &L);void CreateList_R(DuLinkList iL,int L_Data,int n);void Exchange(DuLinkList p);void PrintList(DuLinkList L);結(jié)點(diǎn)的數(shù)據(jù)域指向直接前驅(qū)指向直接后繼/DuLinkList 為指向結(jié)構(gòu)體 DuLNode初始化銷毀鏈表后插法創(chuàng)立循環(huán)雙鏈表/交換前后結(jié)點(diǎn)輸出鏈表int main() (int l_Data=lz2z3;DuLinkList 1;InitList(1);CreateList_R(l,l_Dataz sizeof(l_Data)/sizeof(l_Data0);cout ”雙

3、向鏈表為： PrintList(1);DuLNode *p = l-next-next;cout p 指向的是：data endl;Exchange(p);cout 交換后的雙向鏈表為：；PrintList(1);DestroyList(1);return 0;初始化Status InitList(DuLinkList &L) /構(gòu)造一個(gè)空的單鏈表LL=new DuLNode;L-prior=L;L-nextL;return OK;生成新結(jié)點(diǎn)作為頭結(jié)點(diǎn)，用頭指針L指向頭結(jié)點(diǎn)頭結(jié)點(diǎn)的前驅(qū)指針指向自身頭結(jié)點(diǎn)的后繼指針指向自身銷毀鏈表Status DestroyList(DuLinkList &L)

4、DuLNode *p = L while(p != L)釋放空間釋放空間DuLNode *q=p; p=p-next; delete q;return OK; 后插法創(chuàng)立循環(huán)雙鏈表尾指針r指向頭結(jié)點(diǎn)void CreateList_R(DuLinkList &L,int L_Data(, int n) /正位序輸入n個(gè)元素的值，建立帶表頭結(jié)點(diǎn)的猛環(huán)雙鏈表LDuLNode *r = L;for (int i=0;idata=L_Datai; p-next=L; r-next=p; p-prior=r;L-prior=p; rp;DuLNode *p=new DuLNode; p-data=L_Da

5、tai; p-next=L; r-next=p; p-prior=r;L-prior=p; rp;生成新結(jié)點(diǎn)/初始化p的數(shù)據(jù)域?yàn)長_Datai將新結(jié)點(diǎn)*插入尾結(jié)點(diǎn)”之后 r指向新的尾結(jié)點(diǎn)*p輸出鞋表 void PrintList(DuLinkList L) (DuLNode *p=L; coutNone;p=p-next;while(p!=L)cout data; p=p-next;coutendl;交換void Exchange(DuLinkList p)對(duì)應(yīng)圖2.20 /對(duì)應(yīng)圖2.20 對(duì)應(yīng)圖2.20 對(duì)應(yīng)圖2.20 對(duì)應(yīng)圖2.20 對(duì)應(yīng)圖2.20 /對(duì)應(yīng)圖2.20對(duì)應(yīng)圖2.20 /對(duì)應(yīng)圖2.20 對(duì)應(yīng)圖2.20 對(duì)應(yīng)圖2.20 對(duì)應(yīng)圖2.20 對(duì)應(yīng)圖2.20 /對(duì)應(yīng)圖2.20/在雙向循環(huán)鏈表，交換p所指向的結(jié)點(diǎn)及其前驅(qū)結(jié)點(diǎn)的順序DuLNode *q=p-prior; q-prior-next=p; p-prior=q-prior; q-next=p-nex