1064. Complete Binary Search Tree (30)

最新推荐文章于 2019-02-09 00:51:26 发布

areen7003

最新推荐文章于 2019-02-09 00:51:26 发布

阅读量59

点赞数

原文链接：http://www.cnblogs.com/xLester/p/7570407.html

版权

1064. Complete Binary Search Tree (30)

#include <iostream>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
using namespace std;
vector<int> v,tree;
int k=0,n;
void build(int i)
{
    if(i<=n)
    {
        build(2*i);
        tree[i]=v[k++];
        build(2*i+1);
    }
}
int main(int argc, char const *argv[])
{
    cin>>n;
    v.resize(n);
    tree.resize(n+1);
    for(int i=0;i<n;++i)
        cin>>v[i];
    sort(v.begin(),v.end());
    build(1);
    for(unsigned int i=1;i<tree.size();++i)
        i==tree.size()-1?cout<<tree[i]:cout<<tree[i]<<" ";
    return 0;
}