René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/binary-tree-maximum-path-sum","name":"#124 - Binary Tree Maximum Path Sum - LeetCode JavaScript Solutions","description":"A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can onl...","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 {number}\n */\nvar maxPathSum = function(root) {\n let result = -Infinity;\n\n function traverse(node) {\n if (!node) return 0;\n const leftValue = Math.max(traverse(node.left), 0);\n const rightValue = Math.max(traverse(node.right), 0);\n result = Math.max(result, node.val + leftValue + rightValue);\n return node.val + Math.max(leftValue, rightValue);\n }\n\n traverse(root);\n\n return result;\n};","keywords":"LeetCode 124, #124 - Binary Tree Maximum Path Sum, Hard, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}