树的结构: /** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ 递归解法: public class Solution { public TreeNode reConstructBinaryTree(int [] pre,int [] in) { if (pre != null) return doBuild(pre, in, 0, pre.length-1, 0...