先序 / 后序实现树的遍历 1119题

最新推荐文章于 2023-11-03 22:09:56 发布

从舟

最新推荐文章于 2023-11-03 22:09:56 发布

阅读量210

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/qq_43501398/article/details/105727700

版权

给定一个二叉树的所有键为不同的正整数，可以使用前序和中序或后序和中序遍历来唯一确定一棵树。然而，仅凭后序和前序遍历，可能无法唯一确定对应的树。题目要求根据给定的后序和前序遍历序列，输出对应的中序遍历序列。如果树不唯一，输出任意一种可能的中序遍历。示例展示了当左子树或右子树为空时，无法判断先后序遍历的不唯一性。

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

                    
                        
                    
                    Pre- and Post-order Traversals (30) [树的遍历，前序后序转中序]
 Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be
 determined by a given pair of postorder and inorder traversal sequences, or preorder and inorder
 traversal sequences. However, if only the postorder and preorder traversal sequences are given, the
 corresponding tree may no longer be unique.
 Now given a pair of postorder and preorder traversal sequences, you are supposed to output the
 corresponding inorder traversal sequence of the tree. If the tree is not unique, simply output any one of
 them.
 Input Specification:
 Each input file contains one test case. For each case, the first line gives a positive integer N (<=30), the
 total number of nodes in the binary tree. The second line gives the preorder sequence and the third line
 gives the postorder sequence. All the numbers in a line are separated by a space.
 Output Specification:
 For each test case, first printf in a line “Yes” if the tree is unique, or “No” if not. Then print in the next line
 the inorder traversal sequence of the corresponding binary tree. If the solution is not unique, any answer
 would do. It is guaranteed that at least one soluti

                