282. Range Sum of BST

Given the root of a Binary Search Tree and two integers low and high, return the sum of values of all nodes with a value in the inclusive range [low, high]. Input is given as a level-order array where null represents no node.

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

Run this challenge interactively in Python or JavaScript when the app loads.