René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/construct-string-from-binary-tree","name":"#606 - Construct String from Binary Tree - LeetCode JavaScript Solutions","description":"You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way. The null node needs...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * Definition for a binary tree node.\n * function TreeNode(val) {\n * this.val = val;\n * this.left = this.right = null;\n * }\n */\n/**\n * @param {TreeNode} t\n * @return {string}\n */\nvar tree2str = function(t) {\n return !t ? '' : `${t.val}(${tree2str(t.left)})(${tree2str(t.right)})`.replace(/(\\(\\)){2}|\\(\\)(?=$|\\))/g, '');\n};\n\n\n// alternative, longer but faster version:\n/**\n * @param {TreeNode} t\n * @return {string}\n */\nvar tree2str = function(t) {\n let str = t ? `${t.val}` : '';\n if (t && t.right) str += `(${tree2str(t.left)})(${tree2str(t.right)})`;\n else if (t && t.left) str += `(${tree2str(t.left)})`;\n return str;\n};","keywords":"LeetCode 606, #606 - Construct String from Binary Tree, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}