Evaluate Boolean Binary Tree LeetCode solution in Python

1
# Runtime: 98 ms (Top 35.75%) | Memory: 14.7 MB (Top 20.30%)
2
class Solution:
3
    def evaluateTree(self, root: Optional[TreeNode]) -> bool:
4
        def recur(node):
5
            if not node.left and not node.right:  # leaf node
6
                return True if node.val == 1 else False
7
            left = recur(node.left)
8
            right = recur(node.right)
9
            if node.val == 2:  # if node is or
10
                return left or right
11
            if node.val == 3:  # if node is and
12
                return left and right
13

14
        return recur(root)