#include<iostream>
using namespace std;
typedef struct xx
{
char data;
xx* lchild;
xx* rchild;
}tree, * bitree;
//根据这个图理解下边递归代码
void createbitree(bitree& t)
{
char ch;
cin >> ch;
if (ch == '#')//当输入#时候结点为空
{
t = NULL;
}
else
{
t = new tree;
if (t == NULL)
{
cout << "error" << endl;
}
else
{
t->data = ch;
createbitree(t->lchild);/递归
createbitree(t->rchild);//递归
}
}
return;
}
int main()
{
return 0;
}