1064. Complete Binary Search Tree (30)

1064. Complete Binary Search Tree (30)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

     当初第一次看见这道题的时候一下子就愣住了，完全没有头绪，后来看了MOOC上姥姥的视频才磨出来，然后今天再次遇到这道题目，突然发现这是一道彻彻底底的水题，做出这道题你只需要知道一件事。树的中序遍历序列即为所有元素构成的从小到大的有序序列。如此我们可以通过中序遍历获得一个访问顺序，再将数字填充即可。最后输出时直接打印输出，轻松加愉快。

    

# include <cstdio>
# include <algorithm>

const int _size = 1000;
int tree[2*_size+5],key[_size+5];
void Build(int CurNode,int size)
{
	static int end = 0;
	if (CurNode > size)
	    return;
    Build(CurNode<<1,size);
    tree[CurNode] = key[end++];
    Build((CurNode<<1)^1,size);
}

int main()
{
    int n;
    scanf("%d",&n);
    for (int i=0;i<n;i++)
        scanf("%d",key+i);
    std::sort(key,key+n);
    Build(1,n);
    for (int i=1;i<=n;i++)
        printf("%d%c",tree[i],i==n?'\n':' ');
	return 0;
}