1099. Build A Binary Search Tree (30)-PAT甲级真题

柳婼

已于 2023-11-09 18:02:21 修改

阅读量2.4k

点赞数 14

文章标签： PAT 算法

于 2016-08-11 13:03:43 首次发布

本文链接：https://blog.csdn.net/liuchuo/article/details/52181651

版权

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.