We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 42e9368 commit a1307b8Copy full SHA for a1307b8
javascript/2331-evaluate-boolean-binary-tree.js
@@ -14,15 +14,17 @@
14
* @return {boolean}
15
*/
16
var evaluateTree = function(root) {
17
- return (dfs(root) && true) || false;
+ return dfs(root);
18
};
19
20
const dfs = (node) => {
21
- if(!node.left && !node.right) return node.val;
+ if (!node.left && !node.right && node.val) return true;
22
+ if (!node.left && !node.right && !node.val) return false;
23
24
const is2 = (node.val === 2);
- if(is2) return dfs(node.left) || dfs(node.right);
25
+ if (is2) return dfs(node.left) || dfs(node.right);
26
27
const is3 = (node.val === 3);
- if(is3) return dfs(node.left) && dfs(node.right);
28
+ if (is3) return dfs(node.left) && dfs(node.right);
29
+
30
}
0 commit comments