Create Lowest Common Ancestor of a Binary Search Tree.java

Author: sudoshivesh

medium/Lowest Common Ancestor of a Binary Search Tree.java

@@ -0,0 +1,10 @@
+//235. Lowest Common Ancestor of a Binary Search Tree
+class Solution {
+  public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
+    if (root.val > Math.max(p.val, q.val))
+      return lowestCommonAncestor(root.left, p, q);
+    if (root.val < Math.min(p.val, q.val))
+      return lowestCommonAncestor(root.right, p, q);
+    return root;
+  }
+}