Create 0938-range-sum-of-bst.java

Author: sujal-goswami

java/0938-range-sum-of-bst.java

@@ -0,0 +1,15 @@
+/*--------------------------
+  Time Complexity: O(n)
+  Space Complexity: O(n)
+---------------------------*/  
+class Solution {
+    public int rangeSumBST(TreeNode root, int low, int high) {
+        if(root == null)
+            return 0;
+        if(root.val > high)
+            return rangeSumBST(root.left, low, high);
+        if(root.val < low)
+            return rangeSumBST(root.right, low, high);
+        return root.val + rangeSumBST(root.left, low, high) + rangeSumBST(root.right, low, high);    
+    }
+}