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.

Have you been asked this question in an interview? 
同 construct binary tree from preorder and inorder traversal 一样，只是在preorder 里 root 节点是第一个，postorder 里 换成最后一个即可

/**
 * 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 == null || postorder == null || inorder.length != postorder.length ||inorder.length == 0) {
            return null;
        }
        return buildTree(inorder, 0, inorder.length - 1, postorder, 0, postorder.length - 1);
    }
    private TreeNode buildTree(int[] inorder, int iStart, int iEnd, int[] postorder, int pStart, int pEnd) {
        if (iStart > iEnd) {
            return null;
        }
        TreeNode head = new TreeNode(postorder[pEnd]);
        if (iStart == iEnd) {
            return head;
        }
        int i = iStart;
        for (; i <= iEnd; i++) {
            if (inorder[i] == postorder[pEnd]) {
                break;
            }
        }
        head.left = buildTree(inorder, iStart, i - 1, postorder, pStart, pStart + i - 1 - iStart);
        head.right = buildTree(inorder, i + 1, iEnd, postorder, pStart +i - iStart, pEnd - 1);
        return head;
    }
}