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
这道题自己百思不得其解,甚至想用数学规律的方法去解。
答案的思路让人一目了然: BST,中序遍历一定是递增数列;CBT,可以直接用数组存储。这样的话,直接在中序遍历的过程对树进行填充即可!
//对于BST,中序遍历序列一定是递增的; 那么首先sort,就可以得到中序遍历序列
//对于完全二叉树来说,可以用数组存储
//因此,可以对存储完全二叉树的数组进行中序遍历,在中序遍历的过程中complete the tree
// AMAZING!!!
//题,总是有方法的,联想自己学过的知识点
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 1050;
int tree[maxn]; // 从1到n存储cbt
vector<int> origin;
int n;
int index = 0;
void InOrder(int root) {
if (root > n)
return;
InOrder(2 * root);
tree[root] = origin[index++];
InOrder(2 * root + 1);
}
int num = 0; //已输出的元素个数
void LevelOrder(int root) {
queue<int> q;
q.push(root); // push the index
while (!q.empty()) {
int root = q.front();
printf("%d", tree[root]);
num++;
if (num != n) printf(" ");
q.pop();
if (2 * root <= n)
q.push(2 * root);
if (2 * root + 1 <= n)
q.push(2 * root + 1);
}
}
int main() {
int tmp;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &tmp);
origin.push_back(tmp);
}
sort(origin.begin(), origin.end());
InOrder(1);
LevelOrder(1);
return 0;
}