文章标题

这里写代码片
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
typedef struct Tree{
    char data;
    Tree *lchild,*rchild;
}Node,*BTree;
BTree T;
int cnt,sum;
char str[102];

void create_tree(BTree &T){
if(cnt>=sum) return;
if(str[cnt]=='#') T=NULL;
else{
    T=new Node;
    T->data=str[cnt];
    cnt++;
    T->lchild=T->rchild=NULL;
    create_tree(T->lchild);
    cnt++;
    create_tree(T->rchild);
    //cnt++;

}
}
void cout_tree(BTree &T){
if(T==NULL) return;
cout_tree(T->lchild);
cout<<T->data<<" ";
cout_tree(T->rchild);
}

int main(){
    while(cin>>str){
        sum=strlen(str);
        cnt=0;
        create_tree(T);
        cout_tree(T);
        cout<<endl;

    }


}