René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/balanced-binary-tree","name":"#110 - Balanced Binary Tree - LeetCode JavaScript Solutions","description":"Given a binary tree, determine if it is height-balanced. ...","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 {boolean}\n */\nvar isBalanced = function(root) {\n  if (!root) return true;\n  return isBalanced(root.right) && isBalanced(root.left)\n    && Math.abs(traverse(root.right) - traverse(root.left)) < 2;\n};\n\nfunction traverse(node, depth = 0) {\n  if (!node) return depth;\n  return Math.max(traverse(node.right, depth + 1), traverse(node.left, depth + 1));\n}","keywords":"LeetCode 110, #110 - Balanced Binary Tree, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}