#include <stdio.h>
#include <malloc.h>
typedef struct BTNode
{
char data;
struct BTNode *left, *right;
}BTNode;
BTNode *creat_tree()
{
BTNode *t = NULL;
int x;
//printf ("正在建立一个新二叉树,请输入结点的值:");
scanf ("%d", &x);
if (x == 0) return NULL;
else
{
t = (BTNode *) malloc (sizeof(BTNode));
t -> data = x;
t -> left = creat_tree(
6.52√ 计算二叉树的繁茂度
最新推荐文章于 2020-08-27 13:24:20 发布