feat: add python solution to lc problem: No.0653. Two Sum IV - Input is a BST (doocs#530)

* Added Python Solution to No.0653 in README.md

* Added Python Solution to No.0653 in README_EN.md

* feat: add Python solution to lc problems: No.0653

* Update Solution.py

* Update README_EN.md

* Update README.md

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

Author: AshwinSolanki76

solution/0600-0699/0653.Two Sum IV - Input is a BST/README.md

@@ -54,7 +54,24 @@ Target = 28
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def findTarget(self, root: TreeNode, k: int) -> bool:
+        def find(node):
+            if not node:
+                return False
+            if k - node.val in nodes:
+                return True
+            nodes.add(node.val)
+            return find(node.left) or find(node.right)
+        
+        nodes = set()
+        return find(root)
 ```
 
 ### **Java**

solution/0600-0699/0653.Two Sum IV - Input is a BST/README_EN.md

@@ -60,7 +60,24 @@
 ### **Python3**
 
 ```python
-
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def findTarget(self, root: TreeNode, k: int) -> bool:
+        def find(node):
+            if not node:
+                return False
+            if k - node.val in nodes:
+                return True
+            nodes.add(node.val)
+            return find(node.left) or find(node.right)
+        
+        nodes = set()
+        return find(root)
 ```
 
 ### **Java**

solution/0600-0699/0653.Two Sum IV - Input is a BST/Solution.py

@@ -0,0 +1,18 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def findTarget(self, root: TreeNode, k: int) -> bool:
+        def find(node):
+            if not node:
+                return False
+            if k - node.val in nodes:
+                return True
+            nodes.add(node.val)
+            return find(node.left) or find(node.right)
+        
+        nodes = set()
+        return find(root)