Leetcode 938. Range Sum of BST

Given the root of a binary search tree and an inclusive range [low, high], return the sum of all node values that fall within the range. Leverage the BST ordering to prune subtrees that are entirely < low or > high and traverse only the relevant nodes.