1064 Complete Binary Search Tree

太过精妙，绝壁想不出

#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 1010;
int n, number[maxn], CBT[maxn], index = 0;
void inorder(int root){
	if(root > n) return;
	inorder(root * 2);
	CBT[root] = number[index++];
	inorder(root * 2 + 1);
}
int main(){
	cin >> n;
	for(int i = 0; i < n; i++)
		cin >> number[i];
	sort(number, number + n);
	inorder(1);
	for(int i = 1; i <= n; i++){
		printf("%d", CBT[i]);
		if(i < n) printf(" ");
	}
	return 0;
}