二叉树的结构特性.doc

二叉树的结构特性实验目的1. 掌握指针变量、动态变量的含义。2. 掌握二叉树的结构特性以及各种存储结构的特点和适用范围。实验内容与步骤实验内容与步骤实验内容与步骤2.编写一个程序实现二叉树的各种遍历算法。程序为：#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&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+1,j,ib,i-1); Found_Tree(s-rc,j+1,pe,i+1,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_Tree_sta(Tree *root) Tree *sta50; int i=1; if (root) stai=root; i+; while (i1) while(stai-1) root=stai-1; 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-1) root=stai-1; stai=root-lc; i+; i-; if(i1) printf(%c,stai-1-data); i-; stai=stai-rc; i+; void Last_Traverse_Tree_sta(Tree *root) Tree *sta50; int i=1; if (root) stai=root; i+; while(i1) 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=stai-1-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,len-1); Loop_Traverse_Tree(root); printf(n下面是前序遍历nPre:n); Pre_Traverse_Tree_sta(root); printf(n下面是中序遍历nIn:n); In_Traverse_Tre