二叉樹的結(jié)構(gòu)特性

1、二叉樹的結(jié)構(gòu)特性實 驗 目 的掌握指針變量、動態(tài)變量的含義。掌握二叉樹的結(jié)構(gòu)特性以及各種存儲結(jié)構(gòu)的特點和適用范圍。實 驗 內(nèi) 容 與_lB 步 驟2編寫一個程序?qū)崿F(xiàn)二叉樹的各種遍歷算法。程序為：#include #include#includetypedef struct tree char data;struct tree *lc,*rc;Tree;char pre30=EBADCFHGIKJ,in30=ABCDEFGHIJK;void Found_Tree(Tree * & bt,int pb,int pe,int ib,int ie) int i,j;Tree * s;if (pe=pb

2、&ie=ib)s=(Tree *)malloc(sizeof(Tree); s-data=prepb;bt=s;i=ib;j=pb;while (ini!=prepb)i+;j+； Found_Tree(s-lc,pb+l,j,ib,i-l); Found_Tree(s-rc,j+l,pe,i+l,ie);else bt=NULL;void Loop_Traverse_Tree(Tree * bt) if (bt) printf(%c,bt-data); Loop_Traverse_Tree(bt-lc); Loop_Traverse_Tree(bt-rc);void Pre_Traverse

3、_Tree_sta(Tree *root) Tree *sta50;int i=1;if (root) stai=root;i+；while (i1)實 驗 內(nèi) 容 與_lB實 驗 內(nèi) 容 與_lB步 root=stai-l; printf(%c,root-data); stai=root-lc;i+;i-;if(i1)i-;stai=stai-rc;i+;void In_Traverse_Tree_sta(Tree *root) int i;Tree *sta50;i=1;if (root) stai=root;i+;while (i1) while (stai-l) root=stai-l

4、; stai=root-lc;i+;i-;if(i1) printf(%c,stai-l-data);i-; stai=stai-rc;驗內(nèi) 容 與_lB 步 驟void Last_Traverse_Tree_sta(Tree *root) Tree *sta50;int i=1;if (root) stai=root;i+；while(il) while(stai-1) stai=stai-1-lc;i+；i-;if (i1) stai=stai-1-rc;i+;if (stai-1=NULL)i=i-2;printf(%c,stai-data);while (i1 &stai-1 &stai=staiT-rc) printf(%c,stai-1-data);i-;if (i1) stai=stai-1-rc;i+;void main() int len;Tree *root;len=strlen(pre);Found_Tree(root,0,len-1,0,lenT);Loop_Traverse_Tree(root);printf(n下面是前序遍歷nPre:n);Pre Traverse Tree sta(root);printf(n下面是中序遍歷nln:n); In_Traverse_Tre