二叉树的构建

一、利用先序遍历的结果创建

1：

void CreateTree4(BtNode *&ptr,ElemType *&str)
{
	if(NULL == str || *str == '#')
	{
		ptr = NULL;
	}
	else
	{
		ptr = Buynode();
		ptr->data = *str;
		CreateTree4(ptr->leftchild,++str);
		CreateTree4(ptr->rightchild,++str);
	}
}

int main()
{
    char *str="ABC##DE##F##G#H##";
    BtNode *root = NULL;
    CreateTree4(root,str);

    return 0;
}

2：

BtNode * CreateTree1()
{
	BtNode *s = NULL;
	ElemType item;
	cin>>item;
	if(item != '#')
	{
		s = Buynode();
		s->data = item;
		s->leftchild = CreateTree1();
		s->rightchild = CreateTree1();
	}
	return s;
}
int main()
{
	BtNode *root = NULL;
	root = CreateTree1();
        return 0；
}

二、利用