leetcode/solution/938_Range_Sum_of_BST.py at master · CodexploreRepo/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
class Solution:
    def rangeSumBST(self, root: TreeNode, low: int, high: int, sum = 0) -> int:
        if not root:
            return sum
        elif root.val > high:
            sum = self.rangeSumBST(root.left, low, high)
        elif root.val < low:
            sum = self.rangeSumBST(root.right,low, high)
        else:
            sum = root.val + self.rangeSumBST(root.left, low, high) + self.rangeSumBST(root.right, low, high)
        return sum