void Creat(BTNode *&T)
{
char ch;
cin >> ch;
if ((ch - '#') == 0)
T = NULL;
else
{
T = (BTNode *)malloc(sizeof(BTNode));
T->data = ch;
Creat(T->lchild);
Creat(T->rchild);
}
}
递归创建先序序列二叉树
猜你喜欢
转载自blog.csdn.net/tron_future/article/details/51274589
今日推荐
周排行