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

Problem: Range Sum of BST

Understand how to efficiently sum all node values within a specified range in a binary search tree. Explore leveraging BST properties to prune subtrees and implement an optimized recursive algorithm that minimizes unnecessary visits, improving performance for large trees.

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