#include <bits/stdc++.h>
using namespace std;
#define ll long long

typedef struct Node {
    char data;
    struct Node *left,*right;
}*Btree;

string s;
int counta;
//先序遍历创建
void CreatBinaryTree(Btree &B) {
    char c;
    cin>>c;
    if (c=='#') B=NULL;
    else {
        B = new Node;
        B->data=c;
        CreatBinaryTree(B->left);
        CreatBinaryTree(B->right);
    }
}

//先序输出
void PreOrder(Btree B) {
    if (B==NULL) return;
    cout<<B->data<<' ';
    PreOrder(B->left);
    PreOrder(B->right);
}

//中序输出
void InOrder(Btree B) {
    if (B==NULL) return;
    InOrder(B->left);
    cout<<B->data<<' ';
    InOrder(B->right);
}

//后序输出
void PostOrder(Btree B) {
    if (B==NULL) return;
    PostOrder(B->left);
    PostOrder(B->right);
    cout<<B->data<<' ';
}

//叶子节点

int CountLeap(Btree B) {
    if (B==NULL) return 0;
    if (B->l...