[백준 9934번] 완전 이진 트리

소스코드

---

#include <iostream>
using namespace std;
 
int k, num[1024], End = 2, tree[11][512], depth_idx[10] = {0,};
 
void building(int start,int end, int depth) {
    if (end - start < 0) {
        return;
    }
    int mid = (start + end) / 2;
    tree[depth][depth_idx[depth]++] = num[mid];
    building(start, mid-1, depth+1);
    building(mid+1, end, depth+1);
}
 
int main() {
    cin >> k;
    for (int i = 1; i < k; i++)
        End *= 2;
    for (int i = 1; i < End; i++)
        cin >> num[i];
    building(1,End-1,0);
 
    for (int i = 0; i < k; i++) {
        End = 1;
        for (int j = 0; j < i; j++)
            End *= 2;
        for (int j = 0; j < End; j++) {
            cout << tree[i][j] << " ";
        }
        cout << '\n';
    }
    return 0;
}