【LeetCode】C# 106、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.

给定两个中序和后序遍历的二叉树数组。用他们组件一个二叉树。
思路和前一题一样。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left;
 *     public TreeNode right;
 *     public TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode BuildTree(int[] inorder, int[] postorder) {
        if (inorder == null || postorder == null || inorder.Length == 0 || postorder.Length == 0)
        {
            return null;
        }
        Dictionary<int, int> map = new Dictionary<int, int>();
        for (int i = 0; i < inorder.Length; i++)
        {
            map.Add(inorder[i], i);
        }
        return helper(inorder, postorder, 0, inorder.Length - 1, 0, postorder.Length - 1, map);
    }
    private TreeNode helper(int[] inorder, int[] postorder, int inL, int inR, int postL, int postR, Dictionary<int, int> map)
    {
        if (inL > inR || postL > postR)
            return null;
        TreeNode root = new TreeNode(postorder[postR]);
        int index = map[root.val];
        root.left = helper(inorder, postorder, inL, index - 1, postL, postL + index - inL - 1, map);
        root.right = helper(inorder, postorder, index + 1, inR, postR - (inR - index), postR - 1, map);
        return root;
    }
}