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; }
 * }
 */
class Solution {
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        int length = inorder.length;
        return buildTree(inorder, 0, length - 1, postorder, 0, length - 1);
    }
    public TreeNode buildTree(int[] inorder, int instart, int inend, int[] postorder, int postart, int postend){
        if(instart > inend || postart > postend) return null;
        int rootval = postorder[postend];
        int rootind = 0;
        
        for(int i = instart; i <= inend; i++){
            if(rootval == inorder[i]){
                rootind = i;
                break;
            }
        }
        
        int len = rootind - instart;
        TreeNode root = new TreeNode(rootval);
        root.left = buildTree(inorder, instart, rootind-1, postorder, postart, postart + len - 1);
        root.right = buildTree(inorder, rootind + 1, inend, postorder, postart + len, postend-1 );
        return root;
    }
}