剑指offer07.重建二叉树 javascript

输入某二叉树的前序遍历和中序遍历的结果，请重建该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。

/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */

function TreeNode(val) {
    this.val = val;
    this.left = this.right = null;
}

const buildTree = function(preorder, inorder) {
  if (!preorder.length || !inorder.length) return null
  if (preorder.length === 1 || inorder.length === 1) return new TreeNode(preorder[0])
  const root = preorder[0] // 前序第一个为root
  const inorderRootIndex = inorder.indexOf(root) // 中序根的序号 拆分左右

  const leftInorder = inorder.slice(0, inorderRootIndex + 1) // 中序 左
  const rightInorder = inorder.slice(inorderRootIndex + 1) // 中序 右

  const leftPreorder = preorder.slice(1, leftInorder.length) // 根据中序数量截取 前序 左
  const rightPreorder = preorder.slice(leftInorder.length) // 根据中序数量截取 前序 右

  const tree = new TreeNode(root)
  tree.left = buildTree(leftPreorder, leftInorder)
  tree.right = buildTree(rightPreorder, rightInorder)
  return tree
};