0ms java solution faster than 100%
java\nclass Solution {\n    public int rangeSumBST(TreeNode root, int low, int high) {\n        if (root == null) return 0;\n        int sum = 0;\n        if (r
```java\nclass Solution {\n    public int rangeSumBST(TreeNode root, int low, int high) {\n        if (root == null) return 0;\n        int sum = 0;\n        if (root.val >= low && root.val <= high) sum += root.val;\n        if (root.val > low) sum += rangeSumBST(root.left, low, high);\n        if (root.val < high) sum += rangeSumBST(root.right, low, high);\n\n        return sum;\n    }\n}\n```
['Depth-First Search', 'Binary Search Tree', 'Recursion', 'Java']