Add Search in a Binary Search Tree

dev-jelly · dev-jelly · commit 832bf14013bc · 2020-03-20T19:04:19.000+09:00
diff --git a/leetcode/700/solution.py b/leetcode/700/solution.py
@@ -0,0 +1,25 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+class Solution:
+    def searchBST(self, root: TreeNode, val: int) -> TreeNode:
+        if root is None:
+            return root
+
+        if root.val == val:
+            return root
+
+        if root.left is not None:
+            node = self.searchBST(root.left, val)
+            if node:
+                return node
+
+        if root.right is not None:
+            node = self.searchBST(root.right, val)
+            if node:
+                return node
+
+        return None
