2331-evaluate-boolean-binary-tree.py

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def evaluateTree(self, root: Optional[TreeNode]) -> bool:
        if root.val < 2:
            return root.val

        left = self.evaluateTree(root.left)
        right = self.evaluateTree(root.right)

        return (left or right) if root.val == 2 else (left and right)