题目描述:
给定两个整数数组 inorder 和 postorder ,
其中 inorder 是二叉树的中序遍历, postorder 是同一棵树的后序遍历,
请你构造并返回这颗 二叉树 。
示例 1:
输入:inorder = [9,3,15,20,7], postorder = [9,15,7,20,3]
输出:[3,9,20,null,null,15,7]
示例 2:
输入:inorder = [-1], postorder = [-1]
输出:[-1]
var buildTree = function (inorder, postorder) {
let postIndex = postorder.length - 1;
let map = new Map()
inorder.forEach((item, idx) => {
map.set(item, idx)
})
const help = function (start, end) {
if (start > end) {
return null
}
let root_val = postorder[postIndex];
let root = new TreeNode(root_val)
let index = map.get(root_val)
postIndex -- ;
root.right = help(index + 1, end)
root.left = help(start, index - 1)
return root
}
return help(0, postorder.length - 1)
};