前序,后序,层次和中序都能唯一确定一棵🌲。在加一个层次遍历。
#include <bits/stdc++.h>
using namespace std;
struct tree {
int val;
tree *lc, *rc;
};
vector<int> post, in, ans;
tree *build (int inL, int inR, int postL, int postR) {
if (inL > inR) return NULL;
tree *node = new tree();
node->val = post[postR];
int k = inL;
while (in[k] != post[postR]) k++;
int left = k - inL;
node->lc = build (inL, k - 1, postL, postL + left - 1);
node->rc = build (k + 1, inR, postL + left, postR - 1);
return node;
}
int main() {
int n;
scanf ("%d", &n);
post.resize(n); in.resize(n);
for (int i = 0; i < n; i++) scanf ("%d", &post[i]);
for (int i = 0; i < n; i++) scanf ("%d", &in[i]);
tree *root = build (0, n - 1, 0, n - 1);
queue<tree*> q;
q.push(root);
while (!q.empty()) {
tree *now = q.front();
ans.push_back(now->val);
q.pop();
if (now->lc != NULL) q.push(now->lc);
if (now->rc != NULL) q.push(now->rc);
}
for (int i = 0; i < ans.size(); i++) {
if (i != 0) printf (" ");
printf ("%d", ans[i]);
}
}