Introduction - If you have any usage issues, please Google them yourself
description
In general, given the binary traversal of preorder sequences and postorder traversal sequences, it is not certain that the binary tree will be uniquely identified.
But for a "true binary tree" (a binary tree with two children per internal node), given its preorder, postorder traversal sequence is sufficient to completely determine its structure.
The n nodes of the binary tree are numbered with integers in [1, n], enter the preorder and postorder traversal sequences of a true binary tree, and then output its sequence traversal sequence.
input
The first line is an integer n, which is the number of nodes in the binary tree.
The second and third acts are known as preorder, postorder traversal sequences.
Output
Only one row, given sequence of true binary tree traversal.
ps: from PA of professor Deng Junhui's DAS lecture of Tsinghua University