#235

Author: Parth Shah

235_Lowest_Common_Ancestor_of_a_Binary_Search_Tree.py

@@ -0,0 +1,15 @@
+# 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':
+        if p.val > root.val and q.val > root.val:
+            return self.lowestCommonAncestor(root.right,p,q)
+        elif p.val < root.val and q.val < root.val:
+            return self.lowestCommonAncestor(root.left,p,q)
+        else:
+            return root