public Node buildTree(int[] inorder, int[] postorder) {
        return buildTree(inorder, postorder, 0, inorder.length - 1, postorder.length - 1);
    }
Given inorder and postorder traversal of a tree, construct the binary tree.

https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/
src/com/interview/tree/ContructTreeFromInorderPostOrder.java