Evaluate Boolean Binary Tree LeetCode solution in JavaScript

1
/**
2
* @param {TreeNode} root
3
* @return {boolean}
4
*/
5
var evaluateTree = function (root) {
6
return root.val === 3
7
? evaluateTree(root.left) && evaluateTree(root.right)
8
: root.val === 2
9
? evaluateTree(root.left) || evaluateTree(root.right)
10
: root.val;
11
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0