JAVA 100% Solution (Range Sum of BST)
Complexity\n- Time complexity: O(n)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(1)\n Add your space complexity here, e.g. O(n) \n\n# Co
# Complexity\n- Time complexity: $$O(n)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(1)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int rangeSumBST(TreeNode root, int low, int high) {\n        int sum=0;\n        if(root==null)\n            return sum;\n        if(root.val>=low && root.val<=high)\n            sum+=root.val;\n        \n        sum+=rangeSumBST(root.left,low,high);\n        sum+=rangeSumBST(root.right,low,high);\n\n        return sum;\n    }\n}\n```
['Breadth-First Search', 'Binary Search Tree', 'Recursion', 'Java']