04-树5. Complete Binary Search Tree (30)

04-树5. Complete Binary Search Tree (30)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

8000 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

题意要求该树既是完全二叉树，又是平衡二叉搜索树。完全二叉树的有固定的节点位置关系，若根节点位置为 i，则左孩子节点位置为2* i，右节点位置为2*i+1；而平衡二叉树的中根遍历是有序的，利用这两个性质建立对应的二叉树，即将元素一次性放入它应该所在的位置，可用数组存储。

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

int N,pos=0;
vector<int> s,node;		//爱偷懒，用vector，真的好用 

void Create(int root)		//递归建树 
{
	if(root>N)return;
	int left=2*root,right=2*root+1;
	Create(left);
	node[root]=s[pos++];
	Create(right);
}

int main()
{
	int i,j,num;
	cin>>N;
	for(i=0;i<N;i++){
		cin>>num;
		s.push_back(num);	
	}
	sort(s.begin(),s.end());
	node.resize(1000);		//需要定义node的大小 
	Create(1);
	for(i=1;i<=N;i++){
		cout<<node[i];
		if(i!=N)
			cout<<" "; 
	}
	return 0;
}