《数据结构》04-树6 Complete Binary Search Tree

题目

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

分析

大概题意是：给定一组二叉搜索树插入值，使得刚好该二叉搜索树是棵完全二叉树，输出组成该树的值的层序遍历

考虑到链表的层序遍历还得单独实现，采用数组实现二叉搜索树
整体框架是一个先序遍历，由于给了一组输入，排好序就成了该二叉搜索树的中序序列，利用完全二叉树的性质可以求出左子树结点个数，从而递归填充根结点

#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector