Range Sum of BST

Given the root of a binary search tree (BST) and integers low and high, return the sum of values of all nodes with low <= node.val <= high.

The first input line is the BST in level-order form, ...