May 16

Author: siddydutta

2024-05-May-LeetCoding-Challenge/Evaluate Boolean Binary Tree.py

@@ -0,0 +1,40 @@
+from typing import Optional
+
+
+# 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:
+
+        def dfs(node: TreeNode) -> int:
+            if not node.left and not node.right:
+                return node.val
+            left, right = map(dfs, (node.left, node.right))
+            if node.val == 2:
+                return left or right
+            elif node.val == 3:
+                return left and right
+
+        return bool(dfs(root))
+
+
+def main():
+    root = TreeNode(2)
+    root.left = TreeNode(1)
+    root.right = TreeNode(3)
+    root.right.left = TreeNode(0)
+    root.right.right = TreeNode(1)
+    assert Solution().evaluateTree(root)
+
+    root = TreeNode(0)
+    assert not Solution().evaluateTree(root)
+
+
+if __name__ == '__main__':
+    main()

2024-05-May-LeetCoding-Challenge/README.md

@@ -1,4 +1,4 @@
-# April-LeetCoding-Challenge-2024
+# May-LeetCoding-Challenge-2024
 
 ## Questions
 | Day | Problem | Level | Status |
@@ -18,7 +18,7 @@
 | May 13 | []() |  |  |
 | May 14 | [1219. Path with Maximum Gold](https://leetcode.com/problems/path-with-maximum-gold/) | Medium | Solved |
 | May 15 | []() |  |  |
-| May 16 | []() |  |  |
+| May 16 | [2331. Evaluate Boolean Binary Tree](https://leetcode.com/problems/evaluate-boolean-binary-tree/) | Easy | Solved |
 | May 17 | []() |  |  |
 | May 18 | []() |  |  |
 | May 19 | []() |  |  |
@@ -39,6 +39,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 4 | 4 | 0 |
+| Easy   | 5 | 5 | 0 |
 | Medium | 5 | 4 | 1 |
 | Hard   | 0 | 0 | 0 |