Solve : Lowest Common Ancestor of a Binary Search Tree

Author: printjin-gmailcom

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

@@ -0,0 +1,9 @@
+class Solution:
+    def lowestCommonAncestor(self, root, p, q):
+        while root:
+            if p.val < root.val and q.val < root.val:
+                root = root.left
+            elif p.val > root.val and q.val > root.val:
+                root = root.right
+            else:
+                return root