René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/construct-binary-tree-from-string","name":"#536 - Construct Binary Tree from String - LeetCode JavaScript Solutions","description":"You need to construct a binary tree from a string consisting of parenthesis and integers. The whole input represents a binary tree. It conta...","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 {string} s\n * @return {TreeNode}\n */\nvar str2tree = function(s) {\n  if (!s) return null;\n  let index = 0;\n  return constructTree();\n\n  function parseNumber() {\n    const isNegative = s[index] === '-';\n    if (isNegative) index++;\n\n    let num = 0;\n    while (index < s.length && /[0-9]/.test(s[index])) {\n      num = num * 10 + parseInt(s[index]);\n      index++;\n    }\n\n    return isNegative ? -num : num;\n  }\n\n  function constructTree() {\n    if (index >= s.length) return null;\n\n    const value = parseNumber();\n    const node = new TreeNode(value);\n    if (index < s.length && s[index] === '(') {\n      index++;\n      node.left = constructTree();\n      index++;\n    }\n\n    if (index < s.length && s[index] === '(') {\n      index++;\n      node.right = constructTree();\n      index++;\n    }\n\n    return node;\n  }\n};","keywords":"LeetCode 536, #536 - Construct Binary Tree from String, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}