feat: add missing solution in README and README_EN (#541)

Co-authored-by: Yang Libin <contact@yanglibin.info>

Author: 0xcaffebabe

solution/0900-0999/0938.Range Sum of BST/README.md

@@ -47,15 +47,98 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def rangeSumBST(self, root, L, R):
+        """
+        :type root: TreeNode
+        :type L: int
+        :type R: int
+        :rtype: int
+        """
+        def searchBST(node):
+            if not node:
+                return
+            if L <= node.val <= R:
+                self.ans += node.val
+                searchBST(node.right)
+                searchBST(node.left)
+            elif node.val < L:
+                searchBST(node.right)
+            elif node.val > R:
+                searchBST(node.left)
+        self.ans = 0
+        searchBST(root)
+        return self.ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    private int res = 0;
+    public int rangeSumBST(TreeNode root, int L, int R) {
+        if (root == null) {
+            return res;
+        }
+        
+        if (root.val < L) {
+            rangeSumBST(root.right, L, R);
+        } else if (root.val > R) {
+            rangeSumBST(root.left, L, R);
+        } else {
+            res += root.val;
+            rangeSumBST(root.left, L, R);
+            rangeSumBST(root.right, L, R);
+        }
+        return res;
+        
+    }
+}
+```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int rangeSumBST(TreeNode* root, int L, int R) {
+        if (nullptr == root)
+            return 0 ;
+        stack<TreeNode *> s ;
+        s.push(root) ;
+        int sum = 0 ;
+        while (!s.empty())
+        {
+            TreeNode *node = s.top() ;
+            s.pop() ;
+            
+            if (nullptr == node)
+                continue ;
+            
+            if (node->val > R)
+                s.push(node->left) ;
+            else if (node->val < L)
+                s.push(node->right) ;
+            else
+            {
+                sum += node->val ;
+                s.push(node->left) ;
+                s.push(node->right) ;
+            }
+        }
+        
+        return sum ;
+    }
+};
+
+static int x = []()
+{
+    ios::sync_with_stdio(false); 
+    cin.tie(nullptr); 
+    return 0; 
+}() ;
 ```
 
 ### **...**

solution/0900-0999/0938.Range Sum of BST/README_EN.md

@@ -58,13 +58,96 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def rangeSumBST(self, root, L, R):
+        """
+        :type root: TreeNode
+        :type L: int
+        :type R: int
+        :rtype: int
+        """
+        def searchBST(node):
+            if not node:
+                return
+            if L <= node.val <= R:
+                self.ans += node.val
+                searchBST(node.right)
+                searchBST(node.left)
+            elif node.val < L:
+                searchBST(node.right)
+            elif node.val > R:
+                searchBST(node.left)
+        self.ans = 0
+        searchBST(root)
+        return self.ans
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    private int res = 0;
+    public int rangeSumBST(TreeNode root, int L, int R) {
+        if (root == null) {
+            return res;
+        }
+        
+        if (root.val < L) {
+            rangeSumBST(root.right, L, R);
+        } else if (root.val > R) {
+            rangeSumBST(root.left, L, R);
+        } else {
+            res += root.val;
+            rangeSumBST(root.left, L, R);
+            rangeSumBST(root.right, L, R);
+        }
+        return res;
+        
+    }
+}
+```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int rangeSumBST(TreeNode* root, int L, int R) {
+        if (nullptr == root)
+            return 0 ;
+        stack<TreeNode *> s ;
+        s.push(root) ;
+        int sum = 0 ;
+        while (!s.empty())
+        {
+            TreeNode *node = s.top() ;
+            s.pop() ;
+            
+            if (nullptr == node)
+                continue ;
+            
+            if (node->val > R)
+                s.push(node->left) ;
+            else if (node->val < L)
+                s.push(node->right) ;
+            else
+            {
+                sum += node->val ;
+                s.push(node->left) ;
+                s.push(node->right) ;
+            }
+        }
+        
+        return sum ;
+    }
+};
+
+static int x = []()
+{
+    ios::sync_with_stdio(false); 
+    cin.tie(nullptr); 
+    return 0; 
+}() ;
 ```
 
 ### **...**

solution/1300-1399/1304.Find N Unique Integers Sum up to Zero/Solution.java

@@ -9,4 +9,4 @@ public int[] sumZero(int n) {
       ret[n - 1] = -preSum;
       return ret;
   }
-}
+}