说明：  经典算法：已知树T中结点的前序和中序序列分别放在字符型数组a1，a2中，试编写构造此二叉树的算法。
(The classical algorithm: the known tree T node in the preorder and inorder sequence on the character array a1, a2, try to write the constructed binary tree algorithm.)