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

Problem: Range Sum of BST

Understand how to compute the sum of all nodes in a binary search tree that lie within a given range. Learn to apply recursive pruning based on BST properties to optimize traversal and improve efficiency in C++ implementations.

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 ...