Leetcode no. 106

106. 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 (inorder.length==0 || postorder.length==0) return null;
        return buildTree(inorder, postorder, postorder.length-1, 0, inorder.length-1);
    }
    private TreeNode buildTree(int[] inorder, int[] postorder, int post, int inleft, int inright){
        if (inleft>inright || post<0) return null;
        int index=0;
        TreeNode node= new TreeNode(postorder[post]);
        for (int i = inleft; i <= inright; i++) {
            if (inorder[i]==node.val){
                index=i;
                break;
            }
        }
        node.left= buildTree(inorder, postorder, post-inright+index-1, inleft, index-1);
        node.right= buildTree(inorder, postorder, post-1, index+1, inright);
        return node;
    }
}