René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/maximum-binary-tree","name":"#654 - Maximum Binary Tree - LeetCode JavaScript Solutions","description":"You are given an integer array nums with no duplicates. A maximum binary tree can be built recursively from nums using the following algorit...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * Definition for a binary tree node.\n * function TreeNode(val, left, right) {\n * this.val = (val===undefined ? 0 : val)\n * this.left = (left===undefined ? null : left)\n * this.right = (right===undefined ? null : right)\n * }\n */\n/**\n * @param {number[]} nums\n * @return {TreeNode}\n */\nvar constructMaximumBinaryTree = function(nums) {\n if (!nums.length) return null;\n\n const max = Math.max(...nums);\n const index = nums.indexOf(max);\n const head = new TreeNode(max);\n\n head.left = constructMaximumBinaryTree(nums.slice(0, index));\n head.right = constructMaximumBinaryTree(nums.slice(index + 1));\n\n return head;\n};","keywords":"LeetCode 654, #654 - Maximum Binary Tree, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}