#include<iostream>
using namespace std;

typedef struct node{

    char data;
    struct node *lchild,*rchild;
}Node,*bitree;

//创建二叉树
bitree create(){

    bitree T;
    char ch;
    cin>>ch;

    if(ch!='#'){
        T = new Node;
        T->data = ch;
        T->lchild = create();
        T->rchild = create();
    }
    else{
        T = NULL;
    }

    return T;
}
//中序遍历
void midOrder(bitree T){
    if(T->lchild)   midOrder(T->lchild);
    cout<<T->data<<' ';
    if(T->rchild)   midOrder(T->rchild);
}

int main(){

    bitree T;

    T = create();

    midOrder(T);

}