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 buildTreePostIn(int[] inorder, int[] postorder) { if (inorder == null || postorder == null || inorder.length != postorder.length)  return null; HashMap<Integer, Integer> hm = new HashMap<Integer,Integer>(); for (int i=0;i<inorder.length;++i)  hm.put(inorder[i], i); return buildTreePostIn(inorder, 0, inorder.length-1, postorder, 0,                           postorder.length-1,hm);}

    private TreeNode buildTreePostIn(int[] inorder, int is, int ie, int[] postorder, int ps, int pe,                                      HashMap<Integer,Integer> hm){        if (ps>pe || is>ie) return null;        TreeNode root = new TreeNode(postorder[pe]);        int ri = hm.get(postorder[pe]);        TreeNode leftchild = buildTreePostIn(inorder, is, ri-1, postorder, ps, ps+ri-is-1, hm);        TreeNode rightchild = buildTreePostIn(inorder,ri+1, ie, postorder, ps+ri-is, pe-1, hm);        root.left = leftchild;        root.right = rightchild;        return root;    }}