Maximum Binary Tree LeetCode solution in JavaScript

1
var constructMaximumBinaryTree = function (nums) {
2
  max = Math.max(...nums);
3
  var index = nums.indexOf(max);
4
  var tree = new TreeNode(max);
5
  if (index !== 0) tree.left = constructMaximumBinaryTree(nums.slice(0, index));
6
  if (index !== nums.length - 1)
7
    tree.right = constructMaximumBinaryTree(nums.slice(index + 1));
8
  return tree;
9
};