Kotlin: 235. Lowest Common Ancestor of a BST

Author: MaratKhakim

kotlin/235-Lowest-Common-Ancestor-Of-Binary-Search-Tree.kt

@@ -0,0 +1,21 @@
+/**
+ * Definition for a binary tree node.
+ * class TreeNode(var `val`: Int = 0) {
+ *     var left: TreeNode? = null
+ *     var right: TreeNode? = null
+ * }
+ */
+
+class Solution {
+    fun lowestCommonAncestor(root: TreeNode?, p: TreeNode?, q: TreeNode?): TreeNode? {
+        if (p!!.`val` > root!!.`val` && q!!.`val` > root!!.`val`) {
+            return lowestCommonAncestor(root.right, p, q)
+        }
+
+        if (p!!.`val` < root!!.`val` && q!!.`val` < root!!.`val`) {
+            return lowestCommonAncestor(root.left, p, q)
+        }
+
+        return root
+    }
+}