數(shù)據(jù)結(jié)構(gòu)C語(yǔ)言實(shí)現(xiàn)二叉樹(shù)三種遍歷

1、精選文檔實(shí)驗(yàn)課題一：將下圖中的二叉樹(shù)用二叉鏈表表示：ABCDEFGH1 用三種遍歷算法遍歷該二叉樹(shù)，給出對(duì)應(yīng)的輸出結(jié)果；2 寫(xiě)一個(gè)函數(shù)對(duì)二叉樹(shù)搜索，若給出一個(gè)結(jié)點(diǎn)，根據(jù)其是否屬于該樹(shù)，輸出true或者false。3 寫(xiě)函數(shù)完成習(xí)題4.31（C+版）或4.28（C版教科書(shū)）。#include stdio.h#includemalloc.h typedef struct BiTNode char data; struct BiTNode *lchild,*rchild; BiTNode,*BiTree; BiTree Create(BiTree T) char ch; ch=getchar();

2、if(ch=#) T=NULL; else T=(BiTNode *)malloc(sizeof(BiTNode);T-data=ch;T-lchild=Create(T-lchild); T-rchild=Create(T-rchild); return T; int node(BiTree T)int sum1=0,a,b;if(T)if(T!=NULL)sum1+;a=node(T-lchild); sum1+=a; b=node(T-rchild); sum1+=b; return sum1; int mnode(BiTree T)int sum2=0,e,f;if(T)if(T-lc

3、hild!=NULL)&(T-rchild!=NULL) sum2+;e=mnode(T-lchild); sum2+=e; f=mnode(T-rchild); sum2+=f; return sum2;void Preorder(BiTree T) if(T) printf(%c,T-data); Preorder(T-lchild); Preorder(T-rchild); int Sumleaf(BiTree T) int sum=0,m,n; if(T) if(!T-lchild)&(!T-rchild) sum+; m=Sumleaf(T-lchild); sum+=m; n=Su

4、mleaf(T-rchild); sum+=n; return sum; void zhongxu(BiTree T) if(T) zhongxu(T-lchild); printf(%c,T-data); zhongxu(T-rchild); void houxu(BiTree T) if(T) houxu(T-lchild); houxu(T-rchild); printf(%c,T-data); main() BiTree T; int sum,sum1,sum3;printf(請(qǐng)輸入字符串：n); T=Create(T);printf(前序遍歷:n);Preorder(T);printf(n); printf(中序遍歷:n);zhongxu(T);printf(n); printf(后序遍歷:n); houxu(T); printf(n); sum=Sumleaf(T);printf(樹(shù)葉數(shù)為:n); printf(%d,sum);printf(n);printf(樹(shù)結(jié)點(diǎn)數(shù)為:n); sum1=node(T);printf(n);printf(%d,s