Construct Binary Tree from Preorder and Inorder Traversal

Construct Binary Tree from Preorder and Inorder Traversal

  Total Accepted: 4148  Total Submissions: 16533 My Submissions

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

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

和上一题一样，具体参考：

http://blog.csdn.net/siren0413/article/details/18876855

    public static TreeNode buildTree(int[] preorder, int[] inorder){
        if(inorder.length == 0 || preorder.length == 0) return null;
        Map<Integer, Integer> map = new HashMap<>();
        for(int i = 0; i < inorder.length; i++) map.put(inorder[i],i);
        return buildTreeHelper(preorder,inorder,0,inorder.length-1,0,map);
    }

    private static TreeNode buildTreeHelper(int[] preorder, int[] inorder, int start, int end, int preStart, Map<Integer,Integer> map){
        if(start > end) return null;
        int rootIndex = map.get(preorder[preStart]);
        TreeNode root = new TreeNode(preorder[preStart]);
        root.left = buildTreeHelper(preorder,inorder,start,rootIndex-1,preStart+1,map);
        root.right = buildTreeHelper(preorder,inorder,rootIndex+1,end,preStart+1+(rootIndex-start),map);
        return root;
    }