求二叉树的树深、叶子节点数以及交换其左右子树.docVIP

#includestdio.h #includestdlib.h #define ERROR 0 #define TRUE 1 #define OK 1 #define NULL 0 #define OVERFLOW -1 #define STACK_INIT_SIZE 100 #define StackIncrement 10 #define Selemtype BiTree typedef int Status; typedef struct BiTNode {//二叉树的二叉链表存储结构 char data; struct BiTNode *lchild,*rchild; }BiTNode,*BiTree; Status PrintElement(char e) {//输出函数 printf(%c,e); return OK; }//PrintElement BiTree CreateBiTree(BiTree T) {//按先序序列建立一个二叉树 char ch; scanf(%c,ch); if(ch==#)T=NULL; else{if(!(T=(BiTNode *)malloc(sizeof(BiTNode)))) exit(OVERFLOW); T-data=ch; CreateBiTree(T-lchild); CreateBiTree(T-rchild);} return T; }//CreateBiTree Status PreOrderTraverse(BiTree T) {//先序遍历二叉树的递归运算(1) if(T){ printf(%ch,T-data); PreOrderTraverse(T-lchild); PreOrderTraverse(T-rchild); }else return OK; } //PreOrderTraverse Status PostOrderTraverse(BiTree T) {//后序遍历二叉树的递归运算 if(T){ PostOrderTraverse(T-lchild); PostOrderTraverse(T-rchild); printf(%ch,T-data); }else return OK; }//PostOrderTraverse int LeafCount(BiTree T) {//二叉树中叶子节点的数目 if(!T)return 0; else if(!T-lchild !T-rchild) return 1; else return( LeafCount(T-lchild)+LeafCount(T-rchild)); }//LeafCount Status BtDepth(BiTree T) {//求数的深度(1) int leftdep,rightdep; if(T==NULL)return ERROR; else{ leftdep=BtDepth( T-lchild); rightdep=BtDepth( T-rchild); if(leftdeprightdep)return(leftdep+1); else return(rightdep+1); } }//BtDepth int height(BiTree T) {//求树的深度(2) int m,n; if(T==NULL)return ERROR; else {m=height(T-lchild); n=height(T-rchild); return (mn)?m+1:n+1; } } void Revolute(BiTree T) {//交换左右子树 BiTree tem; tem=T-lchild; T-lchild=T-rchild; T-rchild=tem; } void main() { BiTree T=NULL; //int n; printf(请按次序输入字符: ); T=CreateBiTree(T); printf(The Createment is a success!\n); printf(递归的先序遍历的结果为： ); PreOrderTraverse(T); printf(\n); printf(树的叶子数目为： ); LeafCount(T); printf(%d\n); printf(树的深度为： ); BtDepth( T); printf(%d\n); //另一种方法 ：pri