数据结构--二叉树.docVIP

二叉树 #define OVERFLOW -2 #define NULL 0 #define OK 1 #includeiostream.h #includestdlib.h #includemalloc.h typedef struct BiNode { char data; struct BiNode *lchild,*rchild; }BiNode,*BiTree; void CreateBiTree(BiTreeT){ char ch; cinch; if(ch==#)T=NULL; else{ if(!(T=(BiNode *)malloc(sizeof(BiNode))))exit(OVERFLOW); T-data=ch; CreateBiTree(T-lchild); CreateBiTree(T-rchild); } }//二叉树的建立 void Preorder(BiTree T) {if(T!=NULL) { coutT-data; Preorder(T-lchild); Preorder(T-rchild); } }//先序遍历 void inorder(BiTree T) { if(T!=NULL) {inorder(T-lchild); coutT-data; inorder(T-rchild); } }//中序遍历 void postorder(BiTree T) { if(T!=NULL) {postorder(T-lchild); postorder(T-rchild ); coutT-data ; } }//后序遍历 int lengthget(BiTree T) { int length=0,x,y; if(!T)return 0; else if(!(T-lchild ||T-rchild ))return 1; else {x=lengthget(T-lchild ); y=lengthget(T-rchild ); } length=1+(xy?x:y); return (length); }//求二叉树深度 int countleaf(BiTree T) { int x,y; if(T==NULL)return 0; else if(!(T-lchild ||T-rchild ))return 1;//只有根 else { x=countleaf(T-lchild ); y=countleaf(T-rchild ); } return (x+y); }//求二叉树叶子结点个数 void exchange(BiTree T) {BiNode *TT; if(T!=NULL) { TT=T-lchild ;T-lchild =T-rchild ;T-rchild =TT; exchange(T-lchild ); exchange(T-rchild ); } }//左右子树对调 void main() { BiTree T; cout按先序遍历输入二叉树元素：endl; CreateBiTree(T); { cout其深度为：lengthget(T)endl; cout其叶子结点个数为：countleaf(T)endl; cout按先序遍历结果：;Preorder(T);coutendl; cout中序遍历结果：;inorder(T);coutendl; cout后序遍历结果：;postorder(T);coutendl; } exchange(T); coutendl左右子树对调后endl; cout按先序遍历结果：;Preorder(T);coutendl; cout中序遍历结果：;inorder(T);coutendl; cout后序遍历结果：;postorder(T);coutendl; }