题解 | #树查找#

#include<iostream>
#include<vector>
#include<cmath>
using namespace std;

int main() {
    int n, d;
    scanf("%d", &n);
    vector<int> tree(n);
    for (int i = 0; i < n; i++) {
        cin >> tree[i];
    }
    cin >> d;
    if (pow(2, d - 1) > tree.size()) {
        cout << "EMPTY" << endl;
    } else {
        for (int i = pow(2, d - 1) - 1; i < (pow(2, d) - 1) && i < tree.size(); i++) {
            cout << tree[i] << " ";
        }
    }
    cout << endl;
    return 0;
}