pat1064 Complete Binary Search Tree

地址:https://pintia.cn/problem-sets/994805342720868352/problems/994805407749357568

完全二叉树、平衡二叉树、二叉查找树理解：https://blog.csdn.net/d29h1jqy3akvx/article/details/80331791
因为完全二叉树的中序遍历就是序列从小到大排序后的结果，所以可以模拟中序遍历进行建树，又方便又简洁；
也可以每次找到左子树的节点数找到根节点然后建树；

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int inf = 0x3f3f3f3f;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
const int N = 1005;

int num[N],tree[N];
int n,cnt = 0;

void inorder(int root)
{
    if(root <= n){
        inorder(root * 2);
        tree[root] = num[cnt++];
        inorder(root * 2 + 1);
    }
}

int main()
{
    scanf("%d",&n);
    for(int i = 0;i < n;++i){
        scanf("%d",&num[i]);
    }
    sort(num,num + n);
    inorder(1);
    for(int i = 1;i <= n;++i){
        if(i == n){
            printf("%d\n",tree[i]);
        }else{
            printf("%d ",tree[i]);
        }
    }
    return 0;
}