c語言二叉樹基本操作實(shí)現(xiàn)

1、#include#include#include#definesize100tvpedefstmctbtnchardata;stmctbtn*lchild5*rcliild;btiee,*BT;mtsum;mtcount;mtlefs;voidcreateTree(BT&E)創(chuàng)建二叉樹charch;getchaiQ;pnntfC*請(qǐng)輸入二叉樹的基本元素以*結(jié)束n);scanfC%c”、&ch);if(ch=護(hù))E=NULL;elseB=(BT)nialloc(sizeof(btiee);if(!E)exit(O);B-data=ch;cieateTree(B-lchild);createTre

2、e(B-rchild);return;voidFiistpriiit(BT&E)遞歸先序遍歷二叉樹貞E!=NULL)printf(n%cB-data);Firstprmt(B-lchild);Firstprmt(B-rchild);voidnuddleprint(BT&E)遞歸中序遍歷二叉樹貞E!=NULL)Firstprint(B-lchild);printf(”c*B-data);Firstprmt(B-rchild);voidlastpriiit(BT&E)遞歸后序遍歷二叉樹貞E!=NULL)Firstprint(B-lchild);Firstprmt(B-rchild);printf(

3、”c*B-data);voidnuddlepriiitl(BT&E)非遞歸中序遍歷BTp;BTstack3O;inttop=0;P=B；printf(非遞歸中序遍歷為:n);while(p|top!=0)while(p)stacktop+=p;p=p-lcliild;p=stack-top;printf(,r%c*p-data);p=prchild;pnntf(Mn非遞歸中序遍歷成功mtBtreeDepth(BT&E)求二叉樹的深度intrdjd;return0;elserd=BtieeDepth(B-lchild);ld=BtreeDepth(B-rchild);if(rdld)return

4、ld+1;elsereturnid-rl;mtSuinLefes(BT&Bintsum)求葉子結(jié)點(diǎn)個(gè)數(shù)】f(E)if(B-lcluld=NULL&B-rchild=NULL)sum+;sum=SuniLefes(B-lchild,sum);sum=SuniLefes(B-icliild、sum);retuin(sum);/利用循壞隊(duì)列按照層次遍歷二叉樹/定義隊(duì)列tvpedefstmctqueueBT*base;intfront;intrear;queue;隊(duì)列實(shí)現(xiàn)voidQueueStart(queue&Q)隊(duì)列的初始化Q.base=(BT*)malloc(size*sizeof(BT);if

5、(!Q.base)exit(O);Q.front=0;Q.rear=O;voidQueueliit(queue&Q,BT&p)入隊(duì)rear+1)%size=Q.front)return;Q.baseQ.reai=p;Q.reai-(Q.rear+l)%size;voidQueueOut(queue&Q.BT&p)出隊(duì)printf(%cn,p-data);if(Q.realQ.front)return;p=Q.baseQ.front;Q.fiont=(Q.fiont+1)%size;實(shí)現(xiàn)用循環(huán)隊(duì)列遍歷二叉樹voidleveltree（BT&E）queueS;BTp;P=B；QueueStait(

6、S);】f(P)QueueInt(S,p);while(S.reai!=S.front)QueueOut(S.p);if(p-lcluld)QueueInt(S,p-lcliild);if(p-rcliild)QueueIiit(S.p-rcluld);mtmam()BTB;intmm;pnntfCiW選擇菜單項(xiàng)目An”）；pnntf（1:創(chuàng)建一個(gè)二叉樹5”）；pnntfC*2:遞歸、先序、中序后序遍歷二叉樹5”）;非遞歸中序遍歷二叉樹11）;pnntf（”4:求二叉樹的深度n”）；pmitf（”5:求二叉樹的葉子節(jié)點(diǎn)的個(gè)數(shù)5”）；pnntfC6:利用循壞隊(duì)列對(duì)二叉樹進(jìn)行遍歷n）;while(

7、scanf(H%d,&inin)?=EOF)switch(nmi)case1:createTiee(B);二叉樹創(chuàng)建成功n”)；break;case2:iiitmi;pnntf(”l:先序遍歷n”);printffN:中序遍歷XnJ;prmtf(H3:后序遍歷n”)；while(scanf(H%d,&iin)?=EOF)switch(mi)case1:Fustpnnt(B);pnntfCXn先序遍歷成功n);break:case2:iniddlepiint(B);pnntfCXn中序遍歷成功n);break:case3:lastprmt(B);pmitf(”n后序遍歷成功n);break:prmtf(Hl:先序遍歷iT);prmtf(H2:中序遍歷iT);pnntf(”3:后序遍歷n”)；case3:nuddleprmtl(B);break;case4:count=BtreeDepth(B);二叉樹的深度為:%dXncount);break;case5:lefs=SuniLefes（B,sum）;二叉樹的葉子節(jié)點(diǎn)的個(gè)數(shù)為:dn”,lefs）;break;case6:leveltiee（B）;break;pirntfC1請(qǐng)選擇菜單項(xiàng)目1:創(chuàng)建一個(gè)二叉樹山”）；prmtf（2:遞