#include<stdio.h>
#include<malloc.h>
typedef char dataType;
struct TreeNode{
dataType data;
TreeNode *left,*right;
};
//创建二叉树
void CreateTree(TreeNode *&t,dataType x){
dataType d;
scanf("%c ",&d);
if(d == x){
t = NULL;
}else{
t = (TreeNode*)malloc(sizeof(TreeNode));
t->data = d;
CreateTree(t->left,x);
CreateTree(t->right,x);
}
}
//二叉树的高度
int Height(TreeNode *t){
if(t == NULL) return 0;
int l = Height(t->left);
int r = Height(t->right);
return l>r ? 1+1 : r+1;
}
//二叉树的总结点数
int size(TreeNode *t){
if(t == NULL) return 0;
if(t->left == NULL && t->right == NULL) return 1;
return size(t->left)+size(t->right)+1;
}
//二叉树的叶子节点数
int Leaf(TreeNode *t){
if(t == NULL) return 0;
if(t->left == NULL && t->right == NULL) return 1;
return Leaf(t->left)+Leaf(t->right);
}
//二叉树的最大值
int Max(TreeNode *t){
if(t == NULL) return 0;
if(t->left == NULL && t->right == NULL) return t->data;
int l = Max(t->left);
int r = Max(t->right);
return l>r ? l : r;
}
int main()
{
system("color f1");
TreeNode *t;
CreateTree(t,'#');
printf("二叉树的高度为:%d\n",Height(t));
printf("二叉树的总结点数为:%d\n",size(t));
printf("二叉树的叶子节点数为:%d\n",Leaf(t));
printf("二叉树的最大值为:%c\n",Max(t));
}
最后输入AB##C#D###即可求得二叉树的高度为:3 二叉树的总结点数为:4 二叉树的叶子节点数:2 二叉树的最大值为:D