根据中序和后序遍历重建二叉树的思路和JAVA实现

package treeorder;

public class InfixOrderPostOrderBuildTree {
    public static void main(String[] args) {
        InfixOrderPostOrderBuildTree t = new InfixOrderPostOrderBuildTree();
        int[] inorder = new int[] {2,1};
        int[] postorder = new int[] {1,2};
        TreeNode root = t.buildTree(inorder,postorder);
        System.out.println(root);
    }
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        if (inorder == null || inorder.length == 0 || postorder == null || postorder.length == 0) {
            return null;
        }

        TreeNode root = buildTree(inorder,0,inorder.length - 1, postorder, 0,
                postorder.length - 1);
        return root;
    }

    public TreeNode buildTree(int[] inorder, int inStart, int inEnd, int[] postorder, int postStart, int postEnd) {
        TreeNode tree = new TreeNode(postorder[postEnd]);//根节点
        if (inStart == inEnd || postStart == postEnd) {
            return tree;
        }

        //找出根节点在中序遍历中的位置
        int treeIndex;
        for (treeIndex = inStart; treeIndex <= inEnd; treeIndex ++) {
            if (inorder[treeIndex] == postorder[postEnd]) {
                break;
            }
        }

        int leftChildLength = treeIndex - inStart;//找出当前树（或者子树)的根节点左孩子的长度
        int rightChildLength = inEnd - treeIndex;//找出当前树（或者子树)右孩子的长度

        if (leftChildLength > 0) {//递归构建左子树
            tree.left = buildTree(inorder,inStart,treeIndex - 1, postorder,
                    postEnd - rightChildLength - leftChildLength, postEnd - rightChildLength - 1);
        }

        if (rightChildLength > 0) {//递归构建右子树
            tree.right = buildTree(inorder,treeIndex + 1, inEnd, postorder,
                    postEnd - rightChildLength, postEnd - 1);
        }

        return tree;
    }
}