LeetCode--105. 从前序与中序遍历序列构造二叉树

在理解前序和中序遍历的特点和相互之间的关联后，这道题的思路并不难实现。

public static TreeNode buildTree(int[] preorder, int[] inorder) {
        //前期的剪枝
        if (preorder == null) {
            return null;
        }
        int length = preorder.length;
        if (length == 1) {
            return new TreeNode(preorder[0]);
        }
        //利用Map的性质存储中序遍历，便于以后左右子树节点的计算
        Map<Integer, Integer> index = new HashMap<>();
        for (int i = 0; i < length; i++) {
            index.put(inorder[i], i);
        }
        return myBuildTree(preorder, 0, length - 1, inorder, 0, length - 1, index);
    }

    private static TreeNode myBuildTree(int[] preorder, int preorder_left, int preorder_right,
                                        int[] inorder, int inorder_left, int inorder_right, Map<Integer, Integer> index) {
        if (preorder_left > preorder_right) {
            return null;
        }
        //先序遍历的第一个数为根节点
        int preorder_root = preorder[preorder_left];
        //求出左子树的节点数
        int inorder_root = index.get(preorder_root);
        int size_left_subtree = inorder_root - inorder_left;
        TreeNode root = new TreeNode(preorder_root);
        //迭代：构建左子树
        root.left = myBuildTree(preorder, preorder_left + 1, preorder_left + size_left_subtree,
                inorder, inorder_left, inorder_root - 1, index);
        root.right = myBuildTree(preorder, preorder_left + size_left_subtree + 1, preorder_right,
                inorder, inorder_root + 1, inorder_right, index);
        return root;
    }