PAT甲级 - 1020 Tree Traversals （25 分）

た 入场券 2022-03-17 01:16 324阅读 0赞

题目链接：PAT甲级 - 1020 Tree Traversals （25 分）

Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order 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 (≤30), the total number of nodes in the binary tree. The second line gives the postorder sequence and the third line gives the inorder sequence. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the level order traversal sequence of the corresponding binary tree. All the numbers in a line must be separated by exactly one space, and there must be no extra space at the end of the line.

Sample Input:

  1. 7
  2. 2 3 1 5 7 6 4
  3. 1 2 3 4 5 6 7

Sample Output:

  1. 4 1 6 3 5 7 2

发表评论

表情：
评论列表 （有 0 条评论，324人围观）

还没有评论，来说两句吧...

相关阅读

    相关 A1020. Tree Traversals(25)

    这是一题二叉树遍历的典型题，告诉我们中序遍历和另外一种遍历序列，然后求任何一种遍历序列。 这题的核心： 1. 建树 2. BFS include<bits/

    桃扇骨桃扇骨/ 0 赞/ 303 阅读