PTA-1064 Complete Binary Search Tree

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

这个把样例用二叉树画出来就很清楚了；
画出来如图所示：

因为题目说这是一个二叉搜索树 同时还必须是完全二叉树
所以 左子树最左边一定是最小的 右子树左右边一定最大；
所以我们结合样例可以看出来：
这个二叉树的中序遍历 便是 输入的这个序列从小到大的顺序；
这个我也证明不出来为啥 玄学哇!
有知道的小伙伴联系我QQ 2759723679
告诉我为啥中序遍历是这个从小到大的顺序的

#include <iostream>
#include <algorithm>
using namespace std;

struct node {
	int date=-1;
	int left = 0;
	int right = 0;
}a[2005];
int b[2005];
int num = 1;
int k = 0;
void traverse(int m)//相当于中序遍历了；
{
	if (a[m].date==-1) {
		return;
	}
	traverse(a[m].left);
	a[m].date = b[num++];
	traverse(a[m].right);
}

int main()
{
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		a[i].date = i;
		a[i].left = i * 2;
		a[i].right = i * 2 + 1;
	}
	for (int i = 1; i <= n; i++) {
		cin >> b[i];
	}
	sort(b + 1, b + n+1);
	traverse(1);
	for (int i = 1; i <= n; i++) {
		if(i!=n)
		cout << a[i].date << " ";
		else 
			cout << a[i].date;
	}
	return 0;
}