René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/univalued-binary-tree","name":"#965 - Univalued Binary Tree - LeetCode JavaScript Solutions","description":"A binary tree is uni-valued if every node in the tree has the same value. Given the root of a binary tree, return true if the given tree is ...","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 isUnivalTree = function(root) {\n const traverse = n => !n ? true : n.val === root.val && isUnivalTree(n);\n return traverse(root.left) && traverse(root.right);\n};","keywords":"LeetCode 965, #965 - Univalued Binary Tree, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}