Merge pull request neetcode-gh#641 from diss1993/ticket/235

Swift | 235. Lowest Common Ancestor of a Binary Search Tree

Author: Ahmad-A0

swift/235-Lowest-Common-Ancestor-of-a-Binary-Search-Tree.swift

@@ -0,0 +1,13 @@
+class Solution {
+     func lowestCommonAncestor(_ root: TreeNode?, _ p: TreeNode?, _ q: TreeNode?) -> TreeNode? {
+        guard let root = root, let p = p, let q = q else { return nil }
+        if root.val < p.val && root.val < q.val {
+            return lowestCommonAncestor(root.right, p, q)
+        } else if root.val > p.val && root.val > q.val {
+            return lowestCommonAncestor(root.left, p, q)
+        } else {
+            return root
+        }
+        return nil
+    }
+}