數(shù)據(jù)結(jié)構(gòu)二叉樹的實現(xiàn)與三種遍歷

數(shù)據(jù)結(jié)構(gòu)二叉樹的實現(xiàn)與三種遍歷//實現(xiàn)二叉樹的先序、中序和后序遍歷#defineMAX30//二叉樹中最多結(jié)點數(shù)#defineNULL0#include<stdlib.h>#include<stdio.h>typedefstructbtnode//二叉樹的結(jié)點類型{chardata;structbtnode*lchild,*rchild;}bttree;bttree*cre_tree(char*str,inti,intm)//將字符串中的第i個字符到第個m字符作為數(shù)據(jù)生成對應(yīng)的滿二叉樹{bttree*p;if(i>m)//無效結(jié)點returnNULL;p=(bttree*)malloc(sizeof(bttree));//生成新結(jié)點數(shù)據(jù)結(jié)構(gòu)二叉樹的實現(xiàn)與三種遍歷全文共6頁，當(dāng)前為第1頁。數(shù)據(jù)結(jié)構(gòu)二叉樹的實現(xiàn)與三種遍歷全文共6頁，當(dāng)前為第1頁。p->data=str[i];p->lchild=cre_tree(str,2*i+1,m);//創(chuàng)建左子樹p->rchild=cre_tree(str,2*i+2,m);//創(chuàng)建右子樹returnp;}voidlev_order(chars[],intn)//層次遍歷,即輸出字符數(shù)組的元素{inti;for(i=0;i<n;i++){printf("%c",s[i]);printf("->");}}voidpreorder(bttree*t)//先序遍歷二叉樹{if(t!=NULL)數(shù)據(jù)結(jié)構(gòu)二叉樹的實現(xiàn)與三種遍歷全文共數(shù)據(jù)結(jié)構(gòu)二叉樹的實現(xiàn)與三種遍歷全文共6頁，當(dāng)前為第2頁。{printf("%c",t->data);if(t->lchild){printf("->");preorder(t->lchild);}if(t->rchild){printf("->");preorder(t->rchild);}}}voidinorder(bttree*t)//中序遍歷二叉樹{if(t!=NULL){數(shù)據(jù)結(jié)構(gòu)二叉樹的實現(xiàn)與三種遍歷全文共數(shù)據(jù)結(jié)構(gòu)二叉樹的實現(xiàn)與三種遍歷全文共6頁，當(dāng)前為第3頁。inorder(t->lchild);printf("%c",t->data);printf("->");inorder(t->rchild);}}voidpostorder(bttree*t)//后序遍歷二叉樹{if(t!=NULL){postorder(t->lchild);postorder(t->rchild);printf("%c",t->data);printf("->");}}main()//主函數(shù){數(shù)據(jù)結(jié)構(gòu)二叉樹的實現(xiàn)與三種遍歷全文共數(shù)據(jù)結(jié)構(gòu)二叉樹的實現(xiàn)與三種遍歷全文共6頁，當(dāng)前為第4頁。inti,n;charstr[MAX];bttree*root;//指向根結(jié)點的指針printf("pleaseinputabttreenodenumber:\n");scanf("%d",&n);getchar();//輸入數(shù)字printf("pleaseinputastringwhichlengthis%d:",n);for(i=0;i<n;i++)str[i]=getchar();printf("\n\n");root=cre_tree(str,0,n);//生成二叉樹printf("thetreeisalreadycreated\n");//printf("lev_orderbeforeswapping:");//lev_order(root,n);//printf("\n");printf("lev_orderbeforeswapping:");lev_order(str,n);數(shù)據(jù)結(jié)構(gòu)二叉樹的實現(xiàn)與三種遍歷全文共數(shù)據(jù)結(jié)構(gòu)二叉樹的實現(xiàn)與三種遍歷全文共6頁，當(dāng)前為第5頁。printf("\n");printf("theresultafterpreorderprocessing:");//先序遍歷結(jié)果preorder(root);printf("\n");printf("theresultafterinorderprocessing:");//中序遍歷結(jié)果inorder(root);printf("\n");printf("theresultafterpostorderpr