/**
* Definition for a binary tree node.
* function TreeNode(val, left, right) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* }
*/
/**
* @param {number[]} inorder
* @param {number[]} postorder
* @return {TreeNode}
*/
var buildTree = function(inorder, postorder) {
let len = postorder.length
if (len <= 0) return null
let root_val = postorder[len - 1]
let root = new TreeNode(root_val)
let root_val_index = 0
while (root_val_index < len) {
if (inorder[root_val_index] === root_val) {
break
}
++root_val_index
}
let left_inorder = inorder.slice(0, root_val_index),
left_postorder = postorder.slice(0, root_val_index),
right_inorder = inorder.slice(root_val_index + 1, len),
right_postorder = postorder.slice(root_val_index, len - 1)
root.left = buildTree(left_inorder, left_postorder)
root.right = buildTree(right_inorder, right_postorder)
return root
};
lc106.从中序与后序遍历序列构造二叉树
最新推荐文章于 2024-09-06 08:10:45 发布