1
class Solution:
2
def rangeSumBST(self, root, L, R):
3
if not root:
4
return 0
5

6
if L <= root.val <= R:
7
return (
8
root.val
9
+ self.rangeSumBST(root.left, L, R)
10
+ self.rangeSumBST(root.right, L, R)
11
)
12
elif root.val < L:
13
return self.rangeSumBST(root.right, L, R)
14
else:
15
return self.rangeSumBST(root.left, L, R)

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0