7-8 玩转二叉树 (25分)
给定一棵二叉树的中序遍历和前序遍历,请你先将树做个镜面反转,再输出反转后的层序遍历的序列。所谓镜面反转,是指将所有非叶结点的左右孩子对换。这里假设键值都是互不相等的正整数。
输入格式:
输入第一行给出一个正整数N(≤30),是二叉树中结点的个数。第二行给出其中序遍历序列。第三行给出其前序遍历序列。数字间以空格分隔。
输出格式:
在一行中输出该树反转后的层序遍历的序列。数字间以1个空格分隔,行首尾不得有多余空格。
输入样例:
7
1 2 3 4 5 6 7
4 1 3 2 6 5 7
输出样例:
4 6 1 7 5 3 2
代码:
#include <bits/stdc++.h>
#define ll long long
#define PI acos(-1)
#define mes(x,y) memset(x,y,sizeof(x))
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
const ll inf = 2e9 + 10;
const ll mod = 1e10 + 7;
const ll MAXN = 2e10 + 10;
ll n, m, i, j, t, w, sum;
ll a[31], flagb[31], po[1785];
void buildtree(ll th, ll bea, ll ena, ll beb, ll enb) {
po[th] = a[bea];
if (flagb[po[th]] != beb) {
ll len = flagb[po[th]] - beb;
buildtree(2 * th, bea+1, bea + len, beb, flagb[po[th]] - 1);
}//根据中序遍历确定有左子树
if (flagb[po[th]] != enb) {
ll len = enb - flagb[po[th]];
buildtree(2 * th + 1, ena - len+1, ena, flagb[po[th]] + 1, enb);
}//根据中序遍历确定有右子树
}
vector<ll>v[31];
void frontbianli(ll th, ll step) {
v[step].push_back(po[th]); sum = max(sum, step);
if (po[2 * th] != 0)frontbianli(2 * th, step + 1);
if (po[2 * th + 1] != 0)frontbianli(2 * th + 1, step + 1);
}
int main() {
while (cin >> n) {
for (i = 1; i <= n; i++)cin >> j, flagb[j] = i;
for (mes(po, 0), sum = 0, i = 1; i <= n; i++)cin >> a[i], v[i].clear();
vector<ll>re;
for (buildtree(1, 1, n, 1, n), frontbianli(1, 1), i = 1; i <= sum; i++)
for (j = v[i].size()-1; j >=0 ; j--)re.push_back(v[i][j]);
for (i = 0; i < n - 1; i++)cout << re[i] << " ";
cout << re[i] << endl;
}
}