给定一棵有n 个结点的二叉树，结点的编号为1，2，…，n。已知二叉树结点编号的后 序和中序列表，试设计一个算法，确定该二叉树结点编号的前序列表。-Has given an n-node binary tree, nodes numbered 1,2, ..., n. Known binary tree nodes numbered in sequence after the sequence and form, try to des