var buildTree = function(inorder, postorder){
if(!inorder.length)return null;
let root = new TreeNode(postorder[postorder.length - 1]);
let m = inorder.findIndex(item => item === postorder[postorder.length - 1]);
root.left = buildTree(inorder.slice(0, m), postorder.slice(0, m));
root.right = buildTree(inorder.slice(m + 1, inorder.length), postorder.slice(m, postorder.length - 1));
return root;
}
JS 力扣刷题 106. 从中序与后序遍历序列构造二叉树
最新推荐文章于 2023-02-07 11:01:59 发布