René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/evaluate-boolean-binary-tree","name":"#2331 - Evaluate Boolean Binary Tree - LeetCode JavaScript Solutions","description":"You are given the root of a full binary tree with the following properties: Leaf nodes have either the value 0 or 1, where 0 represents Fal...","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 evaluateTree = function(root) {\n if (!root.left && !root.right) return root.val === 1;\n\n const leftResult = evaluateTree(root.left);\n const rightResult = evaluateTree(root.right);\n\n return root.val === 2 ? leftResult || rightResult : leftResult && rightResult;\n};","keywords":"LeetCode 2331, #2331 - Evaluate Boolean Binary Tree, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}