We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent a1307b8 commit fa30ca4Copy full SHA for fa30ca4
javascript/2331-evaluate-boolean-binary-tree.js
@@ -18,8 +18,7 @@ var evaluateTree = function(root) {
18
};
19
20
const dfs = (node) => {
21
- if (!node.left && !node.right && node.val) return true;
22
- if (!node.left && !node.right && !node.val) return false;
+ if (!node.left && !node.right) return (node.val) ? true : false;
23
24
const is2 = (node.val === 2);
25
if (is2) return dfs(node.left) || dfs(node.right);
0 commit comments