數(shù)據(jù)結(jié)構(gòu)課程設(shè)計(jì)二叉樹(shù)相關(guān)操作源代碼

1、可運(yùn)行C語(yǔ)言數(shù)據(jù)結(jié)構(gòu)課程設(shè)計(jì)二叉樹(shù)相關(guān)操作源代碼#includestdio. h>#include<stdlib. h>#define MAXSIZE 1000 structBiTNode int c;intichild, rchild;BiTNode, *BiTree; structBiTNode treeMAXSIZE; void creat () /創(chuàng)建_.叉樹(shù)函數(shù) inti, j;printff需要輸入權(quán)值個(gè)數(shù):n"); scanf("滋d",&j);辻(j<8) /判斷二叉樹(shù)是否達(dá)到4層printf （錯(cuò)誤：二叉樹(shù)的層數(shù)少

2、于4層! ）;return;printf ("開(kāi)始輸入權(quán)值：)；for (i二 1; i<=j ; i二i+1)/權(quán)值的錄入 scanf(”%d",&treei. c);treei. lchild=2*i;treei.rchild=2*i+l;printf f成功創(chuàng)建二叉樹(shù)n");int leaves ()/統(tǒng)計(jì)葉子個(gè)數(shù)函數(shù)inti, i;1=0;for (i=l;treei. c!=XULL;i+)/計(jì)算二義樹(shù)結(jié)點(diǎn)的個(gè)數(shù)1+；if (1%2)/判斷結(jié)點(diǎn)的奇偶性從而訃算葉子的個(gè)數(shù)return(1-1)/2)+1);elsereturn(1/2);in

3、t deep () /求二叉樹(shù)的深度intd, i, sum;for (i=l;treei. c!=XULL;i+):/計(jì)算二義樹(shù)結(jié)點(diǎn)的個(gè)數(shù)for (d=l;sum<=i;d+)/求出二叉樹(shù)的深度辻(d!二 1)sum=sum+sum*2;return(dl);void qian(int a)/前序遍歷輸出列表辻(treed.c!二NULL)/判斷當(dāng)前結(jié)點(diǎn)是否有值，若有執(zhí)行如下操作，若無(wú)則返回上一層printf (，z%d, ", tree a, c);/首先輸出當(dāng)前結(jié)點(diǎn)(根節(jié)點(diǎn))的權(quán)值qian(a*2);遞歸調(diào)用，用當(dāng)前結(jié)點(diǎn)的左孩子作根節(jié)點(diǎn)重復(fù)當(dāng)前函數(shù)的操作qian(a*2+

4、l);遞歸調(diào)用，用當(dāng)前結(jié)點(diǎn)的右孩子作根節(jié)點(diǎn)重復(fù)當(dāng)前函數(shù)的操作elsereturn;void zhong(int a)/中序遍歷輸出列表辻(tree 2紐.c!二NULL)/首先判斷當(dāng)前結(jié)點(diǎn)的左孩子是否為空，不是就進(jìn)行遞歸調(diào)用，用當(dāng)前結(jié)點(diǎn)的左孩子作根節(jié)點(diǎn)重復(fù)當(dāng)前函數(shù)的操作zhong(2*a);printf (，z%d, “, tree a, c);/輸出當(dāng)前結(jié)點(diǎn)的權(quán)值辻(tree2*a+l.c!=NULL)/判斷當(dāng)前結(jié)點(diǎn)的右孩子是否為空,不是就進(jìn)行遞歸調(diào)用，用當(dāng)前結(jié)點(diǎn)的右孩 子作根節(jié)點(diǎn)重復(fù)當(dāng)前函數(shù)的操作zhong(2*a+l);void hou(int d)/后序遍歷輸出序列辻(tree 2紐.

5、c!二NULL)/判斷當(dāng)前結(jié)點(diǎn)的左孩子是否為空,不是就進(jìn)行遞歸調(diào)用，用當(dāng)前結(jié)點(diǎn)的左孩 子作根節(jié)點(diǎn)重復(fù)當(dāng)前函數(shù)的操作hou(2*a);辻(tree2*a+l.c!=NULL)/判斷當(dāng)前結(jié)點(diǎn)的右孩子是否為空,不是就進(jìn)行遞歸調(diào)用，用當(dāng)前結(jié)點(diǎn)的右孩 子作根節(jié)點(diǎn)重復(fù)當(dāng)前函數(shù)的操作hou(2*a+l);printf (，z%d, “, tree a, c);/輸出當(dāng)前結(jié)點(diǎn)的權(quán)值void main()intd, 1, i;i=10;printf("* J 錄*n");printf ("1、創(chuàng)建二叉樹(shù)n");printf ("2、統(tǒng)計(jì)葉子個(gè)數(shù)n);printf

6、 ("3、求_.叉樹(shù)的深度n");printf C4前序遍歷輸出列表rT）;printf（"5、中序遍歷輸出列表n"）;printf （"6、后序遍歷輸出序列n"）;printf（"0.退出操作）;while(i!=0)printf C選擇操作：);scanf (“&i);辻（i=0）break;else if (i1)printf ("開(kāi)始創(chuàng)建二叉樹(shù)(層數(shù)不少于4層)n");creat ();else if(i二二2)1 二leaves ();printff葉子個(gè)數(shù)為:%dnM);else 辻(i二二3)d二deep();printf ("i.叉樹(shù)的深度是%dn", d);else if (i4)printff用前序遍歷輸出的結(jié)果是：n");qian(l);printf("n");else if(i二二5) printff用中序遍歷輸出的結(jié)果是：n"); zhong(1);printf("n");else if (i6)printf