The order of a Tree （二叉搜索树+先序遍历）

最新推荐文章于 2025-10-27 20:09:49 发布

原创

最新推荐文章于 2025-10-27 20:09:49 发布 · 2k 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#线索二叉树

根据给定的二叉搜索树顺序，找到能构造相同形状且字典序最小的序列。通过先序遍历二叉搜索树来实现。

As we know,the shape of a binary search tree is greatly related to the order of keys we insert. To be precisely:
1. insert a key k to a empty tree, then the tree become a tree with
only one node;
2. insert a key k to a nonempty tree, if k is less than the root ,insert
it to the left sub-tree;else insert k to the right sub-tree.
We call the order of keys we insert “the order of a tree”,your task is,given a oder of a tree, find the order of a tree with the least lexicographic order that generate the same tree.Two trees are the same if and only if they have the same shape.

Input

There are multiple test cases in an input file. The first line of each testcase is an integer n(n <= 100,000),represent the number of nodes.The second line has n intergers,k1 to kn,represent the order of a tree.To make if more simple, k1 to kn is a sequence of 1 to n.