1064 Complete Binary Search Tree (30 分)

1064 Complete Binary Search Tree (30 分)
A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:

The left subtree of a node contains only nodes with keys less than the node’s key.
The right subtree of a node contains only nodes with keys greater than or equal to the node’s key.
Both the left and right subtrees must also be binary search trees.
A Complete Binary Tree (CBT) is a tree that is completely filled, with the possible exception of the bottom level, which is filled from left to right.

Now given a sequence of distinct non-negative integer keys, a unique BST can be constructed if it is required that the tree must also be a CBT. You are supposed to output the level order traversal sequence of this BST.

Input Specification:
Each input file contains one test case. For each case, the first line contains a positive integer N (≤1000). Then N distinct non-negative integer keys are given in the next line. All the numbers in a line are separated by a space and are no greater than 2000.

Output Specification:
For each test case, print in one line the level order traversal sequence of the corresponding complete binary search tree. All the numbers in a line must be separated by a space, and there must be no extra space at the end of the line.

Sample Input:

10
1 2 3 4 5 6 7 8 9 0

结尾无空行
Sample Output:

6 3 8 1 5 7 9 0 2 4

结尾无空行

一直在想这个完全二叉搜索树，完全有啥用，原来是根节点 x，左孩子就是 x * 2，右孩子是 x * 2 + 1，所以这样就能够进行中序遍历，也就能够还原出一个树了，由于完全二叉树的层次遍历就是按数组顺序输出的，所以直接输出即可。

#include<iostream>
#include<bits/stdc++.h>
#include<string>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<deque>
#include<unordered_set>
#include<unordered_map>
#include<cctype>
#include<algorithm>
#include<stack>
using namespace std;
const int N = 1001;
int mid[N];
int order[N];
int n;
int index1 = 1;
void inorder(int root) {
	if (root > n) {
		return;
	}
	inorder(root * 2);
	order[root] = mid[index1++];// 当前这个点的前序位置
	inorder(root * 2 + 1); 
}
int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> mid[i];
	}
	sort(mid + 1, mid + n + 1);
	inorder(1);
	for (int i = 1; i <= n; i++) {
		if (i == 1) {
			cout << order[i];
		} else {
			cout << " " << order[i];
		}
	}
	return 0;
}