72. Construct Binary Tree from Inorder and Postorder Traversal（中序遍历和后序遍历树构造二叉树）

题目描述

Description
Given inorder and postorder traversal of a tree, construct the binary tree.

You may assume that duplicates do not exist in the tree.

Example
Given inorder [1,2,3] and postorder [1,3,2], return a tree:

2
/ \
1 3

描述
根据中序遍历和后序遍历树构造二叉树
你可以假设树中不存在相同数值的节点
您在真实的面试中是否遇到过这个题？
样例
给出树的中序遍历： [1,2,3] 和后序遍历： [1,3,2]
返回如下的树：
2
/ \
1 3

思路

分治递归进行求解，将原先的中序和后序遍历进行拆分，分为左子树的中序和后序，右子树的中序和后序，最后进行递归求解，分割点是当前节点在中序的位置。

代码

这里说一下，拆分排序的时候，也可以用Arrays中的方法copyOfRange进行copy，自己写的话要多注意下下标就行了

public class lintcode72 {

    public class TreeNode {
        public int val;
        public TreeNode left, right;

        public TreeNode(int val) {
            this.val = val;
            this.left = this.right = null;
        }
    }

    /**
     * @param inorder:   A list of integers that inorder traversal of a tree
     * @param postorder: A list of integers that postorder traversal of a tree
     * @return: Root of a tree
     */
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        int len = postorder.length;

        if (len == 0)
            return null;

        int value = postorder[len - 1];
        TreeNode root = new TreeNode(value);
        //找到中序遍历中根节点所在的位置
        int index = 0;
        for (int i = 0; i < len; ++i) {
            if (inorder[i] == value) {
                index = i;
                break;
            }
        }
        //将左子树所有节点用中序和后序遍历
        int[] left_inorder = new int[index];
        int[] left_postorder = new int[index];

        for (int i = 0;  i < index; ++i)
            left_inorder[i] = inorder[i];

        for (int i = 0;  i < index; ++i)
            left_postorder[i] = postorder[i];
        //讲右子树所有节点用中序和后序遍历
        int[] right_inorder = new int[len - index - 1];
        int[] right_postorder = new int[len - index - 1];

        for (int i = index + 1;  i < len; ++i)
            right_inorder[i - index - 1] = inorder[i];

        for (int i = index;  i < len - 1; ++i)
            right_postorder[i - index] = postorder[i];
        //进行递归
        root.left = buildTree(left_inorder, left_postorder);
        root.right = buildTree(right_inorder, right_postorder);
        return root;
    }
}