二叉树的遍历。输入两组数据，分别为二叉树的先序和中序遍历。若能构成一个二叉树，则输出后序遍历，否则输出-1.注意程序并没有建树，只是用数组下标模拟。-Binary tree traversal. Enter the two sets of data, respectively, the first binary sequence and preorder. If we can form a binary tree, the rear output preorder, otherwise the