Sacan 提交的代码
提交时间:2022年6月9日 22:10 语言:C++运行时间:0ms占用内存:269K
运行状态: Accepted
题目:二叉树遍历1161

大会员可查看代码,点此开通大会员

                
                    #include <iostream>

using namespace std;

string s;
int n;
int i;
struct node{
    char value;
    node *left;
    node *right;
};

node* creat(){
    if(i == n){
        return NULL;
    }
    char c = s[i++];
    node *T;
    if(c == '#'){
        T = NULL;
    }else{
        T = (struct node*)malloc(sizeof(node));
        T->value = c;
        T->left = creat();
        T->right = creat();
    }
    return T;
}

void MidOrderTra(node *root){
    if(root != NULL){
        MidOrderTra(root->left);
        cout << root->value << " ";
        MidOrderTra(root->right);
    }
}

int main()
{
    while(cin >> s){
        i = 0;
        n = s.size();
        node *T = creat();
        MidOrderTra(T);
        cout << endl;
    }
    return 0;
}