DIY: Range Sum of BST

Problem statement

For this challenge, you are given the root node of a binary search tree and two values: low and high. Your task is to return the sum of the values of all nodes in BST that are value between low and high ...