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 0Sample Output:
6 3 8 1 5 7 9 0 2 4
分析:本题实际上是要用输入的序列构造一个完全二叉查找树,同时具有完全二叉树(CBT, Complete Binary Tree)和二叉查找树(BST, Binary Search Tree)的特性。即:
- BST的性质:该二叉树经过中序遍历后得到的是原序列升序排列后的结果。
- CBT的性质:如果用顺序列表存储之,标号从1开始,若根节点的下标为i,那么其左子女节点的下标为2i,其右子女节点的下标为2i-1(如果左子女节点和右子女节点存在的话)
vector<int> num; // 储存有序序列
int n, pos = 0; // n为序列的长度
int *tree; // 一维数组,储存最终生成的序列
void build_tree(int k) {
if (k > n) return;
else {
build_tree(2 * k);
tree[k] = num[pos++];
build_tree(2 * k + 1);
}
}
在主函数中调用一次build函数即可:
build_tree(1);
void build_tree(int k) {
if (k > n) return;
else {
tree[k] = num[pos++];
build_tree(2 * k);
build_tree(2 * k + 1);
}
}
void build_tree(int k) {
if (k > n) return;
else {
build_tree(2 * k);
build_tree(2 * k + 1);
tree[k] = num[pos++];
}
}
则需要后序遍历才能得到升序的序列。
①的输出: 0 1 7 2 5 8 9 3 4 6
tree = new int [n + 1];
才可使用。