106. Construct Binary Tree from Inorder and Postorder Traversal

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        HashMap<Integer, Integer> inorderIndex = new HashMap<Integer, Integer>(inorder.length);
        for(int i = 0; i< inorder.length; ++i)
        {
            inorderIndex.put(inorder[i], i);
        }
        return buildTree(inorder, 0, inorder.length, postorder, 0, postorder.length, inorderIndex);
    }
    
    private TreeNode buildTree(int[] inorder, int inorderFrom, int inorderTo, int[] postorder, int postOrderFrom, int postordeTo, HashMap<Integer, Integer> inorderIndex)
    {
        if(inorderFrom>=inorderTo || postOrderFrom>=postordeTo)
            return null;
            
        int rootValue = postorder[postordeTo - 1];
        TreeNode root = new TreeNode(rootValue);
        int rootIndex = inorderIndex.get(rootValue);
        
        root.left = buildTree(inorder, inorderFrom, rootIndex, 
                              postorder, postOrderFrom, postOrderFrom + (rootIndex - inorderFrom), 
                              inorderIndex);
        root.right = buildTree(inorder, rootIndex+1, inorderTo, 
                               postorder, postOrderFrom + (rootIndex - inorderFrom), postordeTo - 1,
                               inorderIndex);
        return root;
    }
}