Construct Binary Tree from Inorder and Postorder Traversal

Given inorder and postorder 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 {
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        if(postorder == null || inorder == null){
            return null;
        }
        HashMap<Integer,Integer> map = new HashMap<>();
        for(int i = 0; i < inorder.length;i++){
            map.put(inorder[i],i);
        }
        return  recursion(postorder,inorder,0, postorder.length-1,0,inorder.length-1,map);
    }
     public TreeNode recursion(int[] postorder, int[] inorder, int postLeft, int postRight, int inLeft,  int inRight, HashMap<Integer, Integer> map){
        if(postLeft > postRight || inLeft > inRight){
            return null;
        }
        TreeNode root = new TreeNode(postorder[postRight]);
        int index = map.get(root.val);
        root.left = recursion(postorder,inorder,postLeft, index-inLeft+postLeft-1,inLeft,index-1,map);
        root.right = recursion(postorder,inorder,postRight-(inRight-index),postRight-1,index+1,inRight,map);
        return root;
    }
}