PAT【甲级】1064

题目链接：PAT【甲级】1064
题目简述：给⼀串树的序列，已知该树是完全⼆叉搜索树，求它的层序遍历的序列。

#include<bits/stdc++.h>
using namespace std;

int n;
vector<int> in(1005), level(1005), v2;
void inTraverse(int root){
    if(root > n) return;
    inTraverse(2 * root);
    v2.push_back(root);
    inTraverse(2 * root + 1);
}
int main(){
    cin >> n;
    for (int i = 1; i <= n;i++)
        cin >> in[i];
    v2.push_back(0);//预插入，填补0号位置
    inTraverse(1);//中序遍历，求得编号的中序序列
    sort(in.begin() + 1, in.begin() + 1 + n);
    for (int i = 1; i <= n; i++)
        level[v2[i]] = in[i];//获得层序遍历序列
    for (int i = 1; i <= n;i++){
        if(i != 1) cout << " ";
        cout << level[i];
    }
    cout << endl;
    return 0;
}

一图胜过所有，尽在不言中！