# 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: # if low <= root val <= high, add to res if not root: return 0 if low <= root.val <= high: return root.val + self.rangeSumBST(root.left, low, high) + self.rangeSumBST(root.right, low, high) elif root.val > high: return self.rangeSumBST(root.left, low, high) elif root.val < low: return self.rangeSumBST(root.right, low, high) leetcode
challenge
Here is the link for the problem:https://leetcode.com/problems/range-sum-of-bst/description/
Top comments (0)