LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal（从前序遍历和中序遍历构造二叉树）

原题网址：https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/

Given preorder and inorder traversal of a tree, construct the binary tree.

Note:
You may assume that duplicates do not exist in the tree.

方法：自顶向下，根据前序遍历和中序遍历的特性构造，通过哈希映射快速确定节点在某个遍历中的位置。

前序遍历总是先出现根节点，所以根据前序遍历就可以自顶向下构造，先构造根节点。中序遍历可以根据根节点，将树分为左右子树。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    private Map<Integer, Integer> imap = new HashMap<>();
    private TreeNode build(int[] preorder, int pfrom, int pto, int[] inorder, int ifrom, int ito) {
        if (pfrom >= pto) return null;
        TreeNode root = new TreeNode(preorder[pfrom]);
        int leftLength = imap.get(preorder[pfrom]) - ifrom;
        TreeNode left = build(preorder, pfrom+1, pfrom+1+leftLength, inorder, ifrom, ifrom+leftLength);
        TreeNode right = build(preorder, pfrom+1+leftLength, pto, inorder, ifrom+leftLength+1, ito);
        root.left = left;
        root.right = right;
        return root;
    }
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        for(int i=0; i<inorder.length; i++) imap.put(inorder[i], i);
        return build(preorder, 0, preorder.length, inorder, 0, inorder.length);
    }
}