PAT-A1099 Build A Binary Search Tree 题目内容及题解

最新推荐文章于 2024-01-13 17:03:41 发布

Bourbon_Whiskey_

最新推荐文章于 2024-01-13 17:03:41 发布

阅读量284

点赞数

分类专栏： PAT甲级文章标签： PAT 甲级 OJ 编程学习

本文链接：https://blog.csdn.net/Bourbon_Whiskey_/article/details/86770149

版权

该博客介绍了PAT甲级编程题A1099，内容包括二叉搜索树定义、输入输出规格、样例输入输出、解题思路及代码实现。博主通过读入节点信息和数字序列，构建二叉搜索树，并进行中序遍历填充节点，最后输出层序遍历结果。

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

Given the structure of a binary tree and a sequence of distinct integer keys, there is only one way to fill these keys into the tree so that the resulting tree satisfies the definition of a BST. You are supposed to output the level order traversal sequence of that tree. The sample is illustrated by Figure 1 and 2.