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
#include<bits/stdc++.h>
using namespace std;
int getLeftLength(const int& n){ //2^h-1+x=n
int height=log2(n+1); //满二叉树的层数
int x=n+1-(int)pow(2,height); //x叶子结点数
x=min(x,(int)pow(2,height-1));
return pow(2,height-1)-1+x;
}
void getLevelOrder(const vector<int>& arr,int start,int end,vector<int>& res,int root){
int n=end-start+1;
if(n==0) return;
int leftLen=getLeftLength(n);
res[root]=arr[start+leftLen];
int leftRoot=root*2+1;
int rightRoot=root*2+2;
getLevelOrder(arr,start,start+leftLen-1,res,leftRoot);
getLevelOrder(arr,start+leftLen+1,end,res,rightRoot);
}
void printResult(const vector<int>& res){
for(int i=0;i<res.size()-1;i++){
cout<<res[i]<<" ";
}
cout<<res[res.size()-1]<<endl;
}
int main(){
int n;
cin>>n;
vector<int> arr(n,0);
for(int i=0;i<n;i++) cin>>arr[i];
sort(arr.begin(),arr.end());
vector<int> res(n,0);
getLevelOrder(arr,0,n-1,res,0);
printResult(res);
return 0;
}