已知先序及中序遍历，重建二叉树
package cn.pbdata.util;
public class PreMidToAfter {
public class TreeNode{
int val;
TreeNode left;
TreeNode right;
public TreeNode(){
left = null;
right = null;
}
}
public TreeNode rebuild(int[] pre……