二叉树的基本操作

void Create(BiTree& pRoot)
{
char ch;
cin >> ch;
if (ch == '#')
{
pRoot = NULL;
}
else
{
pRoot = (BiTNode*)malloc(sizeof(BiTNode));
pRoot->data = ch;
Create(pRoot->lchild);
Create(pRoot->rchild);
}

}

void PreRoot(BiTNode* T)
{
if (T != NULL)
{
cout << T ->data <<endl;
if (T->lchild)
{
PreRoot(T->lchild);
}
if (T->rchild)
{
PreRoot(T->rchild);
}
}

}