1138 Postorder Traversal (25分)

最新推荐文章于 2020-07-30 10:17:02 发布

李小白~

最新推荐文章于 2020-07-30 10:17:02 发布

阅读量357

点赞数

分类专栏： PAT（甲级）文章标签：字符串

本文链接：https://blog.csdn.net/qq_40941722/article/details/105568077

版权

根据给定的先序和中序遍历序列，求解二叉树后序遍历的第一个数。输入包含二叉树节点总数N及两个遍历序列，输出为后序遍历的第一个数。样例输入输出展示了7个节点的树，通过优化代码，仅用先序序列即可解决问题。

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

题目

Suppose that all the keys in a binary tree are distinct positive integers. Given the preorder and inorder traversal sequences, you are supposed to output the first number of the postorder traversal sequence of the corresponding binary tree.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer $N(\le50,000)$ , the total number of nodes in the binary tree. The second line gives the preorder sequence and the third line gives the inorder sequence. All the numbers in a line are separated by a space.