Construct Binary Tree from Inorder and Postorder Traversal

Q:

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

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

Solution:

/**
 * Definition for binary tree
 * 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 (inorder.length == 0 || postorder.length == 0)
            return null;
        TreeNode root = recursiveBuild(inorder, 0, inorder.length-1, postorder, 0, postorder.length-1);
        return root;
    }
    
    TreeNode recursiveBuild(int[] inorder, int ini, int inj, int[] postorder, int posti, int postj) {
        if (ini > inj || posti > postj)
            return null;
        TreeNode root = new TreeNode(postorder[postj]);
        if (ini == inj || posti == postj)
            return root;
        int rooti = 0;
        for (int i = ini; i <= inj; i++) {
            if (inorder[i] == postorder[postj]) {
                rooti = i;
            }
        }
        int leftNum = rooti - ini;
        root.left = recursiveBuild(inorder, ini, rooti-1, postorder, posti, posti+leftNum-1);
        root.right = recursiveBuild(inorder, rooti+1, inj, postorder, posti+leftNum, postj-1);
        return root;
    }
}