【Leetcode】106. Construct Binary Tree from Inorder and Postorder Traversal

题目地址：

https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/

给定一棵二叉树的中序遍历和后序遍历，返回这棵树。题目保证树中所有数字两两不同。

思路和https://blog.csdn.net/qq_46105170/article/details/105761013差不多，也是用递归的方式先从中序遍历中找到树根，然后递归建立左子树和右子树。代码如下：

import java.util.HashMap;
import java.util.Map;

public class Solution {
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        if (inorder == null || inorder.length == 0 || postorder == null || postorder.length == 0) {
            return null;
        }
        
        // 开一个哈希表存一下每个数在中序遍历数组中的下标
        Map<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < inorder.length; i++) {
            map.put(inorder[i], i);
        }
        
        return build(inorder, 0, inorder.length - 1, postorder, 0, postorder.length - 1, map);
    }
    
    // 返回以inorder[beg1, end1]为中序遍历，以postorder[beg2, end2]为后序遍历的二叉树
    private TreeNode build(int[] inorder, int beg1, int end1, int[] postorder, int beg2, int end2, Map<Integer, Integer> map) {
        if (beg1 > end1) {
            return null;
        }
        
        // 先建立树根，然后找到中序遍历中树根的位置，算出左子树的size，然后分别递归建树
        TreeNode root = new TreeNode(postorder[end2]);
        int find = map.get(root.val);
        int sizeLeft = find - beg1;
        root.left = build(inorder, beg1, find - 1, postorder, beg2, beg2 + sizeLeft - 1, map);
        root.right = build(inorder, find + 1, end1, postorder, beg2 + sizeLeft, end2 - 1, map);
        return root;
    }
}

class TreeNode {
    int val;
    TreeNode left, right;
    TreeNode(int x) {
        val = x;
    }
}

时空复杂度$O(n)$。