Practice Range Sum of BST
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given the root node of a binary search tree and two integers low and high, return the sum of values of all nodes with a value in the inclusive range [low, high].
Source: Range Sum of BST on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
root = [10,5,15,3,7,null,18], low = 7, high = 15
Output
32
# 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.val are unique.
Related LeetCode Problems
Practice more problems similar to Range Sum of BST.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.