FunctionRacerProblemsRace

Range Sum of BST

EasyTreesPython, JavaScript, TypeScript, Java, C++

You are given the root of a binary tree. Return the sum of all values in the BST that are between low and high, both included. In a binary search tree every value in a left subtree is smaller than its node and every value in a right subtree is larger. An empty tree gives 0.

Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.

Example 1

root [10,5,15,3,7,null,18]
low 7
high 15
returns 32

7 + 10 + 15 = 32.

Constraints

Race itor take your time

Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.

More Trees problems