236

Author: TedTran2019

ruby/236-Lowest-Common-Ancestor-of-a-Binary-Tree.rb

@@ -0,0 +1,10 @@
+def lowest_common_ancestor(root, p, q)
+  return root if root.val == p.val || root.val == q.val
+  return root if root.val.between?(p.val, q.val) || root.val.between?(q.val, p.val)
+
+  if root.val > p.val
+    lowest_common_ancestor(root.left, p, q)
+  else
+    lowest_common_ancestor(root.right, p, q)
+  end
+end