Update 1448. Count Good Nodes in Binary Tree.py

Co-Authored-By: Antim-IWP <203163676+Antim-IWP@users.noreply.github.com>
Co-Authored-By: Shiwangi Srivastava <174641070+IamShiwangi@users.noreply.github.com>

Author: 3 people

Solution/1448. Count Good Nodes in Binary Tree/1448. Count Good Nodes in Binary Tree.py

@@ -0,0 +1,21 @@
+# 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 goodNodes(self, root: TreeNode) -> int:
+        def dfs(root: TreeNode, mx: int):
+            if root is None:
+                return
+            nonlocal ans
+            if mx <= root.val:
+                ans += 1
+                mx = root.val
+            dfs(root.left, mx)
+            dfs(root.right, mx)
+
+        ans = 0
+        dfs(root, -1000000)
+        return ans