solves two sum iv

Author: anishLearnsToCode

Diff for: README.md

@@ -1,8 +1,8 @@
 # LeetCode Algorithms
 
-![problems-solved](https://img.shields.io/badge/Problems%20Solved-120/571-1f425f.svg)
-![problems-solved-java](https://img.shields.io/badge/Java-120/1571-1abc9c.svg)
-![problems-solved-python](https://img.shields.io/badge/Python-120/1571-1abc9c.svg)
+![problems-solved](https://img.shields.io/badge/Problems%20Solved-143/571-1f425f.svg)
+![problems-solved-java](https://img.shields.io/badge/Java-143/1571-1abc9c.svg)
+![problems-solved-python](https://img.shields.io/badge/Python-143/1571-1abc9c.svg)
 [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](CONTRIBUTING.md)
 
 🔒 = Subscription Content
@@ -168,7 +168,7 @@
 | 637 | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | |
 | 643 | [Maximum Average SubArray I](https://leetcode.com/problems/maximum-average-subarray-i) | [![Java](assets/java.png)](src/MaximumAverageSubArrayI.java) [![Python](assets/python.png)](python/maximum_average_subarray_I.py) |
 | 645 | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [![Java](assets/java.png)](src/SetMismatch.java) [![Python](assets/python.png)](python/set_mismatch.py) |
-| 653 | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | |
+| 653 | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | [![Java](assets/java.png)](src/TwoSumIVInputIsABST.java) [![Python](assets/python.png)](python/two_sum_iv.py) |
 | 657 | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | |
 | 661 | [Image Smoother](https://leetcode.com/problems/image-smoother) | |
 | 665 | [Non Deceasing Array](https://leetcode.com/problems/non-decreasing-array) | |

Diff for: python/two_sum_iv.py

@@ -0,0 +1,17 @@
+# 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 __init__(self):
+        self.elements = set()
+
+    def findTarget(self, root: TreeNode, k: int) -> bool:
+        if root is None: return False
+        if k - root.val in self.elements: return True
+        self.elements.add(root.val)
+        return self.findTarget(root.left, k) or self.findTarget(root.right, k)

Diff for: src/TwoSumIVInputIsABST.java

@@ -0,0 +1,26 @@
+import java.util.HashSet;
+import java.util.Set;
+
+class TreeNode {
+    int val;
+    TreeNode left;
+    TreeNode right;
+    TreeNode() {}
+    TreeNode(int val) { this.val = val; }
+    TreeNode(int val, TreeNode left, TreeNode right) {
+        this.val = val;
+        this.left = left;
+        this.right = right;
+    }
+}
+
+public class TwoSumIVInputIsABST {
+    Set<Integer> elements = new HashSet<>();
+
+    public boolean findTarget(TreeNode root, int k) {
+        if (root ==  null) return false;
+        if (elements.contains(k - root.val)) return true;
+        elements.add(root.val);
+        return findTarget(root.left, k) || findTarget(root.right, k);
+    }
+}