Search⌘ K
AI Features
Home
Courses
Learn Data Structures and Algorithms in JavaScript

Problem: Range Sum of BST

Understand how to solve the range sum problem in a binary search tree by leveraging its ordering properties. Learn to implement an efficient recursive solution that prunes subtrees outside the range and sums qualifying node values, improving performance over brute force traversal.

We'll cover the following...

Statement

You are given the root of a binary search tree (BST) along with two integers low and high. Compute and return the sum of all node values that fall within the inclusive range [low, high].

Note: All node values in the BST are unique.

Constraints:

  • The number of nodes in the tree is in the range [1,2×104][1, 2 \times 10^4].

  • 1≤1 \leq Node.data ...