700

Author: Alimov-8

Data Structure 1/700. Search in a Binary Search Tree.md

@@ -0,0 +1,35 @@
+# Leetocode 700. Search in a Binary Search Tree
+
+
+### Runtime: 106 ms, faster than 52.69% of Python3
+
+<br>
+
+```py
+# 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 searchBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]:
+        def find(root, val):
+            if not root:
+                return None
+            
+            if root.val == val:
+                return root
+                
+            if root.right:
+                if val > root.val:
+                    return find(root.right, val)
+            
+            if root.left:
+                if val < root.val:
+                    return find(root.left, val)
+                
+                
+        return find(root, val)
+```

Data Structure 1/README.md

@@ -56,3 +56,5 @@
 
 - [566. Reshape Matrix -Array](https://github.com/Alimov-8/leetcode-solutions/blob/master/Data%20Structure%201/566.%20Reshape%20Matrix.md#leetcode-566-reshape-matrix)
 
+- [700. Search in a Binary Search Tree - Tree](https://github.com/Alimov-8/leetcode-solutions/blob/master/Data%20Structure%201)
+