Available question text
Given the root of a binary search tree and an inclusive range [low, high], return the sum of all node values that fall within the range. Leverage the BST ordering to prune subtrees that are entirely below low or above high, traversing only the relevant nodes for an efficient solution.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Meta
Leetcode 938. Range Sum of BST
Reported Mar 19, 2026 · 19 source reports
MID_LEVEL, SENIOR, STAFF
Source snapshot: Nov 12, 2026
View source