[C++知识库]C/C++先序创建二叉树以及二叉树的遍历

输入 ABD##E##CF### 创建二叉树

#include <iostream>

using namespace std;

typedef struct BiTNode
{
    char data;
    struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;
void Create(BiTree &T){
    char ch;
    cin>>ch;
    if(ch == '#')
        T = NULL;
    else{
        T = (BiTree )malloc(sizeof(BiTNode));
        if(!T)
            return;
        T->data = ch;
        Create(T->lchild);
        Create(T->rchild);
    }
}
void PreOrder(BiTree T){
    if(T == NULL)
        return;
    cout<<T->data;
    PreOrder(T->lchild);
    PreOrder(T->rchild);
}
/*
寻找某个接节点在第几层
int Findlevel(BiTree bt, char x,int level){
    if(bt){
        if(bt->data == x){
            cout<<level+1<<endl;
            return level;
        }
        Findlevel(bt->lchild,x,level+1);
        Findlevel(bt->rchild,x,level+1);
    }
    return 0;
}*/
int main() {
    BiTree T;
    Create(T);
    PreOrder(T);
    return 0;
    
}