Leetcode 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.

分析：

1. 后序遍历的最后一个节点为树的根节点

2. 找到根节点在中序遍历中的位置，左边的为根节点的左子树，右边的是根节点的右子树

3. 递归的重组左右子树

Java代码实现：

/**
 * 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==null || postorder==null || inorder.length!=postorder.length || inorder.length==0)
            return null;
            
        return helper(inorder, postorder, 0, inorder.length-1, 0, postorder.length-1);
    }
    
    private TreeNode helper(int[] inorder, int[] postorder, int instart, int inend, int poststart, int postend)
    {
        int rootval = postorder[postend];
        TreeNode root = new TreeNode(rootval);
        int mid = findposition(inorder, rootval, instart, inend);
        int leftnum = mid - instart;
        
        if(mid > instart)
            root.left = helper(inorder, postorder, instart, mid-1, poststart, poststart+leftnum-1);
        if(mid < inend)
            root.right = helper(inorder, postorder, mid+1, inend, poststart+leftnum, postend-1);
            
        return root;
    }
    
    private int findposition(int[] arr, int num, int start, int end)
    {
        for(int i=start;i<=end;i++)
        {
            if(arr[i] == num)
                return i;
        }
        return -1;
    }
}