二叉树中序遍历没有结果

运行之后输入二叉树但是没有结果
#include
using namespace std;
日typedef struct BiNode{char data
struct BiNode *lchild, *rchild:
}BiTNode, *BiTree:
日void CreateBiTree(BiTree &T){
char ch:cin >> ch:
if(ch=='#') T=NULL:
else{
T=new BiTNode
T->data=ch:
CreateBiTree(T->lchild)
CreateBiTree(T->rchild)
}
void InOrderTraverse(BiTree T){
if(T）{
InOrderTraverse(T->lchild)cout << T->data
InOrderTraverse(T->rchild)
}
}
void main()
BiTree tree
cout<<“请输入建立二叉链表的序列：\n”CreateBiTree(tree):
cout<<"中序肩历的结果为：\n”InOrderTraverse(tree)
cout<<endl;
}

#include <iostream>
using namespace std;

typedef struct BiNode
{
    char data;
    struct BiNode *lchild, *rchild;
} BiTNode, *BiTree;
void CreateBiTree(BiTree &T)
{
    char ch;
    cin >> ch;
    if (ch == '#')
        T = NULL;
    else
    {
        T = new BiTNode;
        T->data = ch;
        CreateBiTree(T->lchild);
        CreateBiTree(T->rchild);
    }
}
void InOrderTraverse(BiTree T)
{
    if (T)
    {
        InOrderTraverse(T->lchild);
        cout << T->data;
        InOrderTraverse(T->rchild);
    }
}
int main()
{
    BiTree tree;
    cout << "请输入建立二叉链表的序列：\n";
    CreateBiTree(tree);
    cout << "中序肩历的结果为：\n";
    InOrderTraverse(tree);
    cout << endl;
    return 0;
}