1020 Tree Traversals (25 分)

1020 Tree Traversals (25 分)

题目入口：
https://pintia.cn/problem-sets/994805342720868352/problems/994805485033603072

思想

树的遍历
已知后序中序求层序遍历
index用于表示结点在树上的下标 初始化全部结点下标为-1
最后按照index升序输出结点 即为层序遍历
到这里讲解结束

AC代码

#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
vector<int> post, in, level(100000, -1);
void pre(int root, int start, int end, int index){
    if (start > end) return;
    int i = start;
    while (i < end && in[i] != post[root]) i++;
    level[index] = post[root];
    pre(root+i-end-1, start, i-1, index*2+1);
    pre(root-1, i+1, end, index*2+2);
}
int main(){
    int n, node;
    scanf("%d", &n);
    for (int i = 0; i < n; i++){
        scanf("%d", &node);
        post.push_back(node);
    }
    for (int i = 0; i < n; i++){
        scanf("%d", &node);
        in.push_back(node);
    }
    pre(n-1, 0, n-1, 0);
    int cnt = 0;
    for (int i = 0; i < level.size(); i++){
        if (level[i] != -1){
            if (cnt != 0) printf(" ");
            printf("%d", level[i]);
            cnt++;
        }
        if (cnt == n) break;
    }
    return 0;
}

AC代码(二刷)

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
struct node{
    int id, index, level;
};
vector<node> post, in, pre;
void pre_order(int root, int startt, int endd, int index, int level){
    if (startt > endd) return;
    int i = startt;
    while (i < endd && in[i].id != post[root].id) i++;
    pre.push_back({post[root].id, index, level});
    pre_order(root+i-endd-1, startt, i-1, index*2+1, level+1);
    pre_order(root-1, i+1, endd, index*2+2, level+1);
}
bool cmp(node x, node y){
    if (x.level != y.level) return x.level < y.level;
    return x.index < y.index;
}
int main(){
    int n;
    scanf("%d", &n);
    post.resize(n);
    in.resize(n);
    for (int i = 0; i < n; i++)
        scanf("%d", &post[i].id);
    for (int i = 0; i < n; i++)
        scanf("%d", &in[i].id);
    pre_order(n-1, 0, n-1, 0, 0);
    sort(pre.begin(), pre.end(), cmp);
    for (int i = 0; i < n; i++){
        if (i) printf(" ");
        printf("%d", pre[i].id);
    }
    return 0;
}