2331. Evaluate Boolean Binary Tree

Super Easy. https://leetcode.com/problems/evaluate-boolean-binary-tree/

let isor = (node) => node.val === 2;
let isLeaf = (node) => node.val < 2;
var evaluateTree = function (root) {
  if (isLeaf(root)) {
    return !!root.val;
  }
  let [bl, br] = [root.left, root.right].map(evaluateTree);
  return isor(root) ? bl || br : bl && br;
};