根据先序和中序构建二叉树

话不多说，直接源码（来自leetcode一题，本人的题解）：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    int[] preOrder;
    int[] inOrder;
    public TreeNode buildTree(int[] preorder1, int[] inorder1) {
        preOrder = preorder1;
        inOrder = inorder1;
        return dfs(0, preOrder.length - 1, 0, inOrder.length - 1);
    }
    public TreeNode dfs(int preLeft, int preRight, int inLeft, int inRight)
    {
        //System.out.println(preLeft + " " + preRight + " " + inLeft + " " + inRight);
        if(preLeft > preRight)
            return null;
        TreeNode node = new TreeNode(preOrder[preLeft]);
        for(int i = 0; ; i++)
        {
            if(inOrder[i + inLeft] == preOrder[preLeft])
            {
                node.left = dfs(preLeft + 1, preLeft + i, inLeft, inLeft + i);
                node.right = dfs(preLeft + 1 + i, preRight, inLeft + i + 1, inRight);
                break;
            }
        }
        return node;
    }
}

简而言之，通过递归创建二叉树，注重每个位置上左右子树的位置就好了。