solve 2

Author: lylaminju

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

@@ -0,0 +1,22 @@
+'''
+시간 복잡도: O(h) (h = 트리 높이)
+공간 복잡도: O(1)
+'''
+# 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':
+        node = root
+
+        while node:
+            if p.val < node.val and q.val < node.val:
+                node = node.left
+            elif node.val < p.val and node.val < q.val:
+                node = node.right
+            else:
+                return node