Time: 331 ms (16.71%), Space: 64.6 MB (60.79%) - LeetHub

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

@@ -0,0 +1,27 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+public:
+    int ans=0;
+    void solve(TreeNode* root, int low, int high)
+    {
+        if(root==NULL)return;
+        if(root->val>=low && root->val<=high)
+            ans+=root->val;
+        solve(root->left,low,high);
+        solve(root->right,low,high);
+    }
+    int rangeSumBST(TreeNode* root, int low, int high) {
+        solve(root,low,high);
+        return ans;
+    }
+};