Time: 309 ms (88.33%), Space: 50.8 MB (51.67%) - LeetHub

Author: hogan-tech

1973-count-nodes-equal-to-sum-of-descendants/1973-count-nodes-equal-to-sum-of-descendants.py

@@ -1,3 +1,5 @@
+# time complexity: O(n)
+# space complexity: O(n)
 from typing import Optional
 
 
@@ -22,7 +24,7 @@ def countNodes(node: Optional[TreeNode]) -> int:
             if left + right == node.val:
                 count += 1
             return node.val + left + right
-        
+
         countNodes(root)
         return count