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
分析
给出n个数来用他们构造一棵完全二叉排序树。对于完全二叉树,如果用数组按照层序存储,那么每一个节点x都满足左子树在2x,右子树在2x+1;而对于二叉搜索树,中序排列即是数字的升序排列。综上所述,先将数字升序排列后,按照中序遍历讲数字一个个填入数组即可。
#include<bits/stdc++.h>
using namespace std;
int data[1000],in[1000],n,index;
void inorder(int now)
{
if(now>n)
return;
inorder(2*now);
in[now]=data[index++];
inorder(2*now+1);
}
int main()
{
cin >> n;
for(int i=0;i<n;i++)
cin >> data[i];
sort(data,data+n);
inorder(1);
for(int i=1;i<=n;i++){
if(i>1)
cout <<" " << in[i];
else
cout <<in[i];
}
}