add 235-lowest-common-ancestor-of-a-binary-search-tree python

abe-101 · abe-101 · commit fa12eddb58b4 · 2022-07-21T15:04:32.000-04:00
diff --git a/235-lowest-common-ancestor-of-a-binary-search-tree b/235-lowest-common-ancestor-of-a-binary-search-tree
@@ -0,0 +1,17 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+class Solution:
+    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
+        cur = root
+        while cur:
+            if p.val > cur.val and q.val > cur.val:
+                cur = cur.right
+            elif p.val < cur.val and q.val < cur.val:
+                cur = cur.left
+            else:
+                return cur
