/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { //pre,vin为root根节点的二叉树,前序和中序数组 public TreeNode reConstructBinaryTree(int [] pre,int [] vin) { ...