Time: 190 ms (58.86%), Space: 35 MB (50.47%) - LeetHub

hovanhoa · Oct 18, 2023 · 481198a · 481198a
1 parent 634dfa4
commit 481198a
Showing 1 changed file with 1 addition and 2 deletions.
diff --git a/1544-count-good-nodes-in-binary-tree/1544-count-good-nodes-in-binary-tree.py b/1544-count-good-nodes-in-binary-tree/1544-count-good-nodes-in-binary-tree.py
@@ -7,11 +7,10 @@
 class Solution:
     def goodNodes(self, root: TreeNode) -> int:
         return self.getGoodNodes(root, float("-inf"))
-        
+
     def getGoodNodes(self, root: TreeNode, newMax: int) -> int:
         if not root:
             return 0
 
         newMax = max(newMax, root.val)
         return (1 if root.val >= newMax else 0) + self.getGoodNodes(root.left, newMax) + self.getGoodNodes(root.right, newMax)
-