René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/binary-tree-tilt","name":"#563 - Binary Tree Tilt - LeetCode JavaScript Solutions","description":"Given the root of a binary tree, return the sum of every tree node's tilt. The tilt of a tree node is the absolute difference between t...","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 findTilt = function(root) {\n const result = { val: 0 };\n dfs(root, result);\n return result.val;\n};\n\nfunction dfs(root, tilt) {\n if (!root) return 0;\n const left = dfs(root.left, tilt);\n const right = dfs(root.right, tilt);\n tilt.val += Math.abs(left - right);\n return root.val + left + right;\n}","keywords":"LeetCode 563, #563 - Binary Tree Tilt, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}