solves lowest common ancestor in bst

Author: anishLearnsToCode

README.md

@@ -70,7 +70,7 @@
 | 231 | [Power of Two](https://leetcode.com/problems/power-of-two) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/PowerOf2.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/is_power_of_2.py) |
 | 232 | [Implement Queue Using Stacks](https://leetcode.com/problems/implement-queue-using-stacks) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/MyQueue.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/implement_queue_using_stacks.py) | 
 | 234 | [Palindrome Linked Lists](https://leetcode.com/problems/palindrome-linked-list) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/PalindromeLinkedList.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/palindrome_linked_list.py) | 
-| 235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/LowestCommonAncestorOfBinarySearchTree.java) |
+| 235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/LowestCommonAncestorOfBinarySearchTree.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/lowest_common_ancestor_of_bst.py) |
 | 237 | [Delete a Node In A Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/DeleteANodeInLinkedList.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/delete_node_in_linked_list.py) |
 | 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/ValidAnagram.java) |
 | 243 | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) | Easy | |

python/lowest_common_ancestor_of_bst.py

@@ -0,0 +1,35 @@
+from collections import deque
+
+
+# Definition for a binary tree node.
+class TreeNode:
+    def __init__(self, x):
+        self.val = x
+        self.left = None
+        self.right = None
+
+    def __repr__(self):
+        return str(self.val)
+
+    def __str__(self):
+        return str(self.val)
+
+
+class Solution:
+    def get_path_to(self, root: TreeNode, node: TreeNode) -> deque:
+        path = deque()
+        while root.val != node.val:
+            path.append(root)
+            root = root.left if root.val > node.val else root.right
+        path.append(root)
+        return path
+
+    def lowestCommonAncestor(self, root: TreeNode, p: TreeNode, q: TreeNode) -> TreeNode:
+        path_p = self.get_path_to(root, p)
+        path_q = self.get_path_to(root, q)
+        index = 0
+        for node_p, node_q in zip(path_p, path_q):
+            if node_p is not node_q:
+                break
+            index += 1
+        return path_p[index - 1]