Amarkant814
diff --git a/‎08 August Leetcode Challenge 2021/17_goodNodesinBT.py
Copy file name to clipboard
+11Lines changed: 11 additions & 0 deletions b/‎08 August Leetcode Challenge 2021/17_goodNodesinBT.py
Copy file name to clipboard
+11Lines changed: 11 additions & 0 deletions
@@ -0,0 +1,11 @@
+class Solution:
+    def __init__(self):
+        self.count = 0
+
+    def goodNodes(self, root):
+        for child in filter(None, [root.left, root.right]):
+            self.count += child.val >= root.val
+            child.val = max(child.val, root.val)
+            self.goodNodes(child)
+  
+        return self.count + 1