二叉树构建与遍历

#include <QCoreApplication>
#include<iostream>
using namespace std;

typedef struct BT_Node
{
    char data;
    struct BT_Node* lchild,*rchild;

}BT_Node,*BTree;



bool creatBT(BTree &bt)
{
    char c;

    scanf("%c",&c);
    if(c==' ')
    {
        bt=NULL;
    }
    else
    {
        bt=(BTree)malloc(sizeof(BT_Node));
        bt->data=c;
        creatBT(bt->lchild);
        creatBT(bt->rchild);
    }

}



bool preTravse(BTree p,int level)
{
    if(p)
    {
        cout<<p->data<<"level:"<<level<<endl;
        preTravse(p->lchild,level+1);
        preTravse(p->rchild,level+1);
    }

}


int main(int argc, char *argv[])
{
    QCoreApplication a(argc, argv);
    BTree bt;
    creatBT(bt);
    preTravse(bt,1);

    return a.exec();
}