{
return 1;
}
}
return 0;
}
int CompTree(BTree *tree1,BTree *tree2)//二叉树是否相等 {
if (!tree1 && !tree2)
{
return 1;
}
else if (tree1->data == tree2->data &&
CompTree(tree1->left, tree2->left) && CompTree(tree1->right, tree2->right)) {
return 1;
}
else
{
return 0;
}
}
int main()
{
BTree* btr=Create();
printf("叶子结点个数为：\n");
int leafgs=leafcount(btr);
printf("%d \n",leafgs);
printf("结点总数为：\n");
int countn=CountNode(btr);
printf("%d \n",countn);
printf("度为1的结点个数为：%d\n",countn-2*leafgs+1); printf("度为2的结点个数为：%d\n",leafgs-1);
printf("二叉树的高度：\n");
int Hgt=Height(btr);
printf("%d \n",Hgt);