René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/binary-tree-paths","name":"#257 - Binary Tree Paths - LeetCode JavaScript Solutions","description":"Given the root of a binary tree, return all root-to-leaf paths in any order. A leaf is a node with no children. ...","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 {TreeNode} root\n * @return {string[]}\n */\nvar binaryTreePaths = function(root) {\n return tranverse(root);\n};\n\nfunction tranverse(node, path = [], result = []) {\n if (!node) return;\n path.push(node.val.toString());\n if (!node.left && !node.right) {\n result.push(path.join('->'));\n } else {\n tranverse(node.left, path.slice(), result);\n tranverse(node.right, path.slice(), result);\n }\n return result;\n}","keywords":"LeetCode 257, #257 - Binary Tree Paths, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}