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