{"trustable":false,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"MD","content":"我们知道二叉树是指最多有两个孩子的树,分别为左孩子和右孩子,或者左子树和右子树。根据根节点以及左右子树的访问顺序不同,对二叉树的遍历分别有先序遍历、中序遍历和后序遍历。\n\n现在给定一棵树的先序遍历和中序遍历,试求出其后序遍历。"}},{"title":"Input","value":{"format":"MD","content":"输入包括**多组数据**。每组数据的第一行包括一个整数n(1\u003c\u003dn\u003c\u003d1000),表示树的节点数。后面接着输入两行,分别代表树的先序遍历和中序遍历。数据保证它们对应着一棵正确的二叉树。"}},{"title":"Output","value":{"format":"MD","content":"对于每组测试数据,输出一行,表示对应二叉树的后序遍历。**数字之间用一个空格隔开,最后一个数字后面没有空格!**"}},{"title":"Sample Input","value":{"format":"MD","content":"9\n1 2 4 7 3 5 8 9 6\n4 7 2 1 8 5 9 3 6"}},{"title":"Sample Output","value":{"format":"MD","content":"7 4 2 8 9 5 6 3 1"}}]}