solve : lowest common ancestor of a binary search tree

Author: SamTheKorean

lowest-common-ancestor-of-a-binary-search-tree/samthekorean.py

@@ -0,0 +1,16 @@
+# TC : O(log n) because its a balanced tree
+# SC : O(1)
+class Solution:
+    def lowestCommonAncestor(
+        self, root: "TreeNode", p: "TreeNode", q: "TreeNode"
+    ) -> "TreeNode":
+        current = root
+
+        # Return when they split to left and right
+        while current:
+            if p.val > current.val and q.val > current.val:
+                current = current.right
+            elif p.val < current.val and q.val < current.val:
+                current = current.left
+            else:
+                return current