javascript recursive solution
\nconst rangeSumBST = (root, L, R) => {\n\tif (root === null) {\n  \t    return 0;\n    }    \n\n    return (root.val >= L && root.val <= R ? root.val : 0) + ra
```\nconst rangeSumBST = (root, L, R) => {\n\tif (root === null) {\n  \t    return 0;\n    }    \n\n    return (root.val >= L && root.val <= R ? root.val : 0) + rangeSumBST(root.left, L , R) + rangeSumBST(root.right, L , R);\n}\n```
['Binary Search', 'Recursion', 'Binary Tree', 'JavaScript']