COCI '13 Contest 5 #2 Obilazak

    1#include <bits/stdc++.h>
    2 
    3using namespace std;
    4 
    5struct Node {
    6    int val;
    7    Node* left;
    8    Node* right;
    9    Node(int v) : val(v),left(nullptr), right(nullptr){}
    10 
    11};
    12int height, indx;
    13vector<int> seq;
    14Node* build(int depth){
    15    if(depth > height) return nullptr;
    16    Node* root = new Node(0);
    17    root->left = build(depth + 1);
    18    root->val = seq[indx++];
    19    root->right = build(depth + 1);
    20    return root; 
    21}
    22int main(){
    23    ios::sync_with_stdio(0);
    24    cin.tie(0);
    25    cin >> height;
    26    int total = (1 << height) - 1;
    27    seq.resize(total);
    28    for(int i = 0; i < total; i++){
    29        cin >> seq[i];
    30    }
    31    indx = 0;
    32    Node* root = build(1);
    33    queue<Node*> q;
    34    q.push(root);
    35    priority_queue<int> pq;
    36    while(!q.empty()){
    37        int size = q.size();
    38        for(int i = 0; i < size; i++){
    39            Node* cur = q.front(); q.pop();
    40            cout << cur->val << (i == size - 1 ? "\n" : " ");
    41            if(cur->left) q.push(cur->left);
    42            if(cur->right) q.push(cur->right);
    43        }
    44    }
    45    return 0;
    46}