数据结构经典题目给定序列生成完全二叉搜索树

最新推荐文章于 2024-04-05 20:44:38 发布

wwxy261

最新推荐文章于 2024-04-05 20:44:38 发布

阅读量1.4k

点赞数 2

分类专栏：算法

本文链接：https://blog.csdn.net/wwxy1995/article/details/89251455

版权

04-树6 Complete Binary Search Tree （30 point(s))

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 (≤