递归递归! /** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution { public TreeNode construct(int[]pre,int[]vin,int pl,int pr,int vl,int vr){ TreeNode head=new TreeNode(pre[pl]); int i=0; for(i=v...