画了个dfs的图，整明白了。

模拟中序遍历

```#include[HTML_REMOVED]

include[HTML_REMOVED]

using namespace std;

const int N = 1010;
int n, idx = 1;
int t[N], level[N];

void inorder(int u)
{
if (u > n) return ;

inorder(u * 2);

level[u] = t[idx++];

inorder(u * 2 + 1);

}

int main()
{
cin >> n;
for (int i = 1; i <= n; i++) cin >> t[i];
sort(t + 1, t + n + 1);

inorder(1);

for (int i = 1; i <= n; i++)
{
    cout << level[i];
    if (i != n) cout << ' ';
}
return 0;

}
```