Simple Recursive Solution. Faster than 96%
\nconst rangeSumBST = (root, L, R) => {\n    let sum = 0;\n    const traverse = (root) => {\n        if (root.val >= L && root.val <= R) sum += root.val;\n     
```\nconst rangeSumBST = (root, L, R) => {\n    let sum = 0;\n    const traverse = (root) => {\n        if (root.val >= L && root.val <= R) sum += root.val;\n        if (root.left !== null) traverse(root.left);\n        if (root.right !== null) traverse(root.right);\n    }\n    traverse(root);\n    return sum;\n};\n```
['Recursion', 'JavaScript']