1064 Complete Binary Search Tree (30point(s)) 需要二刷 *二叉排序树和完全二叉树之间的联系

#include<iostream>
#include<stdlib.h>
#include<stdio.h>
#include<vector> 
#include<string>
#include<math.h>
#include<algorithm>
#include<cstring>
#include<map>
#include<queue>
using namespace std;

vector<int>seq;
vector<int>layer;
int tree[1020];
int n;
int st = 0;

void inorder(int index) {
    if (index > n)
        return;
    inorder(index * 2);
    tree[index] = seq[st++];
    inorder(index * 2 + 1);
}

void layer_find() {
    queue<int>q;
    q.push(1);
    while (!q.empty()){
        int index = q.front();
        layer.push_back(tree[index]);
        q.pop();
        if (index * 2 <= n) {
            q.push(index * 2);
        }
        if (index * 2+1 <= n) {
            q.push(index * 2 + 1);
        }
    }
}

int main() {
    fill(tree, tree + 1020, -1);
    int a;
    cin >> n;
    seq.resize(n);
    for (int i = 0; i < n; i++) {
        cin >> seq[i];
    }
    sort(seq.begin(), seq.end());
    inorder(1);
    layer_find();
    for (int i = 0; i < n;i++) {
        if (i == 0)
            cout << layer[i];
        else
            cout << " " << layer[i];
    }
    return 0;
}