GO: 235. Lowest Common Ancestor of a BST

MaratKhakim · MaratKhakim · commit 84c941bcdbb5 · 2022-08-13T10:59:23.000+02:00
diff --git a/go/235-Lowest-Common-Ancestor-of-BST.go b/go/235-Lowest-Common-Ancestor-of-BST.go
@@ -0,0 +1,20 @@
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val   int
+ *     Left  *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+
+func lowestCommonAncestor(root, p, 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
+}
