Runtime: 106 ms (Top 94.04%) | Memory: 24.40 MB (Top 92.45%)

Author: AnasImloul

scripts/algorithms/R/Range Sum of BST/Range Sum of BST.py

@@ -1,21 +1,16 @@
+// Runtime: 106 ms (Top 94.04%) | Memory: 24.40 MB (Top 92.45%)
+
 class Solution:
-    def rangeSumBST(self, root: Optional[TreeNode], low: int, high: int) -> int:
-    
-        res = 0
+    def rangeSumBST(self, root, L, R):
+        if not root:
+            return 0
 
-        def dfs(node):
-            nonlocal res
-            
-            if not node:
-                return
-            
-            if node.val >= low and node.val <= high:
-                
-                res += node.val
-                
-            dfs(node.left)
-            dfs(node.right)
-            
-        dfs(root)
-        
-        return res
+        if L <= root.val <= R:
+            return root.val + self.rangeSumBST(root.left, L, R) + self.rangeSumBST(root.right, L, R)
+        elif root.val < L:
+            return self.rangeSumBST(root.right, L, R)
+        else:
+            return self.rangeSumBST(root.left, L, R)
+
+
+