PTA-04-树6 Complete Binary Search Tree

最新推荐文章于 2022-05-08 12:59:46 发布

「已注销」

最新推荐文章于 2022-05-08 12:59:46 发布

阅读量131

点赞数

分类专栏： PTA

本文链接：https://blog.csdn.net/sukihasimoto/article/details/102964058

版权

给定一系列不重复的非负整数，构建一棵同时满足二叉搜索树和完全二叉树条件的树。输出该树的层序遍历序列。输入包含一个正整数N（N≤1000），接下来一行给出N个不重复且不超过2000的整数。输出层序遍历序列，数字间用空格隔开。

摘要由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 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.