創建二叉樹

//建樹
#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 main(){
    BiTree tree;
    cout<<"請輸入創建二叉鏈表的序列：\n";
    CreateBiTree(tree);
    cout<<"所創建的二叉鏈表中序序列：\n";
    InOrderTraverse(tree);
    cout<<endl;
}