Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 128

Range Sum of BST

EasyBST

Return the sum of every node value in the BST that lies in [low, high]. Prune branches the invariant says cannot contain answers.

Examples

Example 1

Input: root = [10,5,15,3,7,null,18], low = 7, high = 15

Output: 32

Constraints

The number of nodes is in [1, 2 * 10⁴]

Target ComplexityNot required

O(n) Time · O(h) Space

Companies (3)

AmazonFacebookGoogle

Node 22.08.0

Loading editor…

Test casesRun to compare output

Inputroot = [10,5,15,3,7,null,18], low = 7, high = 15

Expected32

Output—