#1562Easy#40 in Yandex's list· asked at 1 company
Range Sum of BST
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: root = [10,5,15,3,7,null,18], low = 7, high = 15 Output: 32
7 + 10 + 15.
Example 2
Input: root = [10,5,15,3,7,13,18,1,null,6], low = 6, high = 10 Output: 23
Constraints
- •
The number of nodes in the tree is in the range
[1, 2 * 10^4]. - •
1 <= Node.val <= 10^5 - •
1 <= low <= high <= 10^5 - •
All
Node.valare unique.