PAT甲级 1020 Tree Traversals（二叉树的遍历与建树）

#include <iostream>
#include<cstdio>
#include<map>
#include<queue>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;

const int maxn = 30;
int n;
int postOrd[maxn + 5], inOrd[maxn + 5];
vector<int> layer[30];

struct node{
    int data;
    node* left;
    node* right;
};
//由后序遍历和中序遍历建树
node* create(int postL, int postR, int inL, int inR, int deep){
    //边界条件，不存在该后序遍历序列，退出
    if(postL > postR) return NULL;
    //创建新节点并赋值
    node* root = new node;
    root->data = postOrd[postR];//后序遍历最后一个数是根节点
    //找到中序序列中该根节点的下标并保存在k中
    layer[deep].push_back(postOrd[postR]);

    int k;
    for(int i = 0; i < n; i++){
        if(inOrd[i] == postOrd[postR]){
            k  = i;
            break;
        }
    }
    //左子树节点个数为k-inL,分别求该节点的左儿子和右儿子..
    int numLeft = k - inL;
    root->left = create(postL, postL+numLeft - 1, inL, k-1, deep+1);
    root->right = create(postL+numLeft, postR-1, k+1, inR, deep+1);

    return root;
}

int main(){
    scanf("%d", &n);
    for(int i = 0; i < n; i++){
        scanf("%d", &postOrd[i]);
    }
    for(int i = 0; i < n; i++){
        scanf("%d", &inOrd[i]);
    }
    node* root = create(0, n-1, 0, n-1, 1);
    int flag = 0;
    for(int i = 1; i <30; i++){
        int len = layer[i].size();
        for(int j = 0; j < len; j++){
            if(flag) printf(" ");
            printf("%d", layer[i][j]);
            flag = 1;
        }
    }

    return 0;
}