LeetCode: 700 solved

Author: devMEremenko

Python/LeetCode/700. Search in a Binary Search Tree.py

@@ -0,0 +1,20 @@
+# https://leetcode.com/problems/search-in-a-binary-search-tree/
+
+# 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: TreeNode, val: int) -> TreeNode:
+        if not root:
+            return None
+        
+        if val == root.val:
+            return root
+        
+        if val < root.val:
+            return self.searchBST(root.left, val)
+        return self.searchBST(root.right, val)