leetcode 106. Construct Binary Tree from Inorder and Postorder Traversal

生命不息，奋斗不止

---

@author stormma
@date 2018/03/23

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

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

For example, given

inorder = [9,3,15,20,7]
postorder = [9,15,7,20,3]
Return the following binary tree:

    3
   / \
  9  20
    /  \
   15   7

解法同105. Construct Binary Tree from Preorder and Inorder Traversal

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

        private TreeNode buildTree(Map<Integer, Integer> map, int[] in, int inStart, int inEnd
                , int[] post, int postStart, int postEnd) {
            if (inStart > inEnd || postStart > postEnd) return null;
            TreeNode node = new TreeNode(post[postEnd]);
            int i = map.get(post[postEnd]);
            node.left = buildTree(map, in, inStart, i - 1, post, postStart, postStart + i - inStart - 1);
            node.right = buildTree(map, in, i + 1, inEnd, post, postStart + i - inStart, postEnd - 1);
            return node;
        }
    }