[数据结构学习日记]PTA-Complete Binary Search Tree

最新推荐文章于 2022-08-05 11:35:07 发布

LazyHan

最新推荐文章于 2022-08-05 11:35:07 发布

阅读量461

点赞数

文章标签：数据结构学习 c++

本文链接：https://blog.csdn.net/LazyHan/article/details/124646699

版权

根据给定的非负整数序列，构建一个同时满足二叉搜索树和完全二叉树条件的独特树。输出该树的层次遍历序列。输入包含一个测试案例，第一行给出节点数量N（≤1000），下一行给出N个不重复的整数。层次遍历序列应按空格分隔，没有额外空格。

摘要由CSDN通过智能技术生成

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 th