说明：  问题描述： 给定一棵有n 个结点的二叉树，结点的编号为1，2，…，n。已知二叉树结点编号的后序和中序列表，试设计一个算法，确定该二叉树结点编号的前序列表。 实验任务： 对于给定的二叉树结点编号的后序和中序列表，计算二叉树结点编号的前序列表。
(Description of the problem: there is a given n the binary tree nodes, the nodes numbered 1,2, ..., n. Known number of tree nodes in the sequence after the sequence and form, try to design an algorithm to determine the binary tree before the node numbering sequence table. Experimental task: the binary tree for a given number of nodes in the sequence after the sequence and form, the calculation of the binary tree before the node numbering sequence table.)