#938. Range Sum of BST

https://leetcode.com/problems/range-sum-of-bst/description/?envType=daily-question&envId=2024-01-08

function rangeSumBST(root, low, high) {
    let sum = 0

    funtion traverse(node) {
    if (node.val >= low && node.val <= high) sum += node.value

    if (node.val > low) traverse(node.left)

    if (node.val < high) traverse(node.right)
    }

    traverse(root)

    return sum
}