创建空的二叉树

热心网友 · 2018-4-30 02:32:48

typedef struct node *tree_pointer;
typedef struct node
{
int data;
tree_pointer left_child,right_child;
}node;

tree_pointer create(tree_pointer head) //根节点
{
head = NULL;
return head;
}

BlueStar1021 · 2018-4-30 02:32:49

void聽InitBiTree(BiTree聽&t)
{
t=(BiTree)malloc(sizeof(BiTNode));
if(!t)
exit(-2);
}这样貌似不行吧，只是生成二叉树结点异常时以-2结束，但是并不能生成空的二叉树！

laojin7 · 2018-4-30 02:32:50

typedef struct Node
{
char data;
Node *lChild,*rChild;
}TREE;

TREE *makeTree()
{
TREE *a = NULL;
char ch;
ch = getchar();
if(ch == '#')
return NULL;
a = (TREE *)malloc(sizeof(TREE));
if(a == NULL)
return NULL;
a->data = ch;
a->lChild = makeTree();
a->rChild = makeTree();
return a;
}
这是生成一个先序二叉树，截取makeTree前段代码就可生成一个空的二叉树

创建空的二叉树

3 个回复