Sync LeetCode submission Runtime - 1 ms (75.11%), Memory - 25.2 MB (7.17%)

Author: jimit105

0975-range-sum-of-bst/solution.py

@@ -1,18 +1,18 @@
 # Approach 1: Depth First Search (Recursive)
 
-# Time: O(N)
-# Space: O(N)
+# Time: O(n)
+# Space: O(n)
 
 # 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 rangeSumBST(self, root: Optional[TreeNode], low: int, high: int) -> int:
         ans = 0
+
         def dfs(node):
             nonlocal ans
             if node:
@@ -25,3 +25,4 @@ def dfs(node):
 
         dfs(root)
         return ans
+