二叉树的先中相关常用算法c语言版.docVIP

#includestdio.h #include string.h #include stdlib.h typedef char T; typedef struct btnode //结点定义 { T Element; struct btnode *LChild,*RChild; }BTNode; typedef struct btree //头结点定义 { struct btnode *Root; }BTree; BTNode* NewNode() //创建空间 { BTNode *p=(BTNode*)malloc(sizeof(BTNode)); return p; } BTNode * DGCreateBT() //递归创建一棵二叉树 { char c; BTNode *s; //s=(BTNode *)malloc(sizeof(BTNode)); // c=getchar(); scanf(%c,c); getchar() ; if(c==.) { s=NULL; } else { //s=NewNode(); s=(BTNode *)malloc(sizeof(BTNode)); s-Element=c; s-LChild=DGCreateBT(); s-RChild=DGCreateBT(); } return s; } void Visit(BTNode *p) //输出结点*P的元素值 { printf(%3c,p-Element); } void PreOrd(BTNode *t) //先序遍历递归函数 { if(t) { (*Visit)(t); PreOrd(t-LChild); PreOrd(t-RChild); } } void InOrd(BTNode *t) //中序遍历递归函数 { if(t) { InOrd(t-LChild); (*Visit)(t); InOrd(t-RChild); } } void PostOrd(BTNode *t) //后序遍历递归函数 { if(t) { PostOrd(t-LChild); PostOrd(t-RChild); (*Visit)(t); } } /*void PreOrder(BTree Bt,void (*Visit)(BTNode *u)) //先序遍历 { PreOrd(Visit,Bt.Root); } void InOrder(BTree Bt,void (*Visit)(BTNode *u)) //中序遍历 { InOrd(Visit,Bt.Root); } void PostOrder(BTree Bt,void (*Visit)(BTNode *u)) //后序遍历 { PostOrd(Visit,Bt.Root); }*/ int Size(BTNode *p) //树的结点数 { int s,s1,s2; if(!p) return 0; else { s1=Size(p-LChild); s2=Size(p-RChild); s=s1+s2+1; return s; } } int SizeofBT(BTree Bt) //树的结点数 { return Size(Bt.Root); } int Depth(BTNode *p) //树的高度递归函数 { if(!p) return 0; else return 1+max(Depth(p-LChild),Depth(p-RChild)); } /*int DepthofBT(BTree Bt) //树的高度 { return Depth(Bt.Root); }*/ void PrintLeaf(BTNode *bt) { if(bt!=NULL) { if(bt-LChild==NULLbt-RChild==NULL) { printf(%3c,bt-Element); } else { PrintLeaf(bt-LChild); PrintLeaf(bt-RChild); } } } int CountLeaf(BTNode *bt) { int s1,s2; if(bt!=NULL) { if(bt-LChild==NULLbt-RChild==NULL) retu