PAT A1064. Complete Binary Search Tree (30) [⼆叉查找树BST]

A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:
The lef 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 lef 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 lef 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
题⽬⼤意：给⼀串构成树的序列，已知该树是完全⼆叉搜索树，求它的层序遍历的序列
分析：总得概括来说，已知中序，可求root下标，可以求出层序。

1. 因为⼆叉搜索树的中序满⾜：是⼀组序列的从⼩到⼤排列，所以只需排序所给序列即可得到中
   序
2. 因为根据完全⼆叉树的结点数，可以求出它的根结点在中序中对应的下标
3. 如此，已知了中序，⼜可以根据结点数求出根结点的下标，就可以递归求出左右⼦树的根结点
   的下标
4. i结点的左孩⼦为2 * i + 1，右孩⼦2 * i + 2，就可以根据结点下标和中序数组赋值level数组
5. 最后输出所有结点的层序数组level

#include <iostream>
#include <vector>
#include <