1064 Complete Binary Search Tree (30 分)
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个数值,要求形成完全二叉排序树,并输出层序序列。
思路:
将输入的序列从小到大排序,此即为二叉排序树的中序遍历,用静态数组装载二叉树,遍历该数组即为层序遍历
参考代码:
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> list, level;
int n, idx;
void inorder(int v){
if(v >= n) return;
inorder(v * 2 + 1);
level[v] = list[idx++];
inorder(v * 2 + 2);
}
int main(){
scanf("%d", &n);
list.resize(n), level.resize(n);
for(int i = 0; i < n; ++i) scanf("%d", &list[i]);
sort(list.begin(), list.end());
inorder(0);
for(int i = 0; i < n; ++i) printf("%d%c", level[i], i != n - 1? ' ': '\n');
return 0;
}