René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/path-sum","name":"#112 - Path Sum - LeetCode JavaScript Solutions","description":"Given the root of a binary tree and an integer targetSum, return true if the tree has a root-to-leaf path such that adding up all the values...","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 * @param {number} targetSum\n * @return {boolean}\n */\nvar hasPathSum = function(root, targetSum) {\n if (!root) {\n return false;\n }\n const result = [];\n\n traverse(result, root);\n\n return result.includes(targetSum);\n};\n\nfunction traverse(result, node, sum = 0) {\n if (!node.left && !node.right) {\n result.push(sum + node.val);\n }\n\n if (node.left) traverse(result, node.left, sum + node.val);\n if (node.right) traverse(result, node.right, sum + node.val);\n}","keywords":"LeetCode 112, #112 - Path Sum, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}