Create LowestCommonAncestorBST.java

In Interviews If Tree Data Structure Is Discussed Then This Is Probably One Of The Most Important Question
I Have Solved This Using Recursion

Author: akashSky369

LowestCommonAncestorBST.java

@@ -0,0 +1,13 @@
+//Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST. 
+
+
+public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
+        if(p.val<root.val && q.val<root.val){
+            return lowestCommonAncestor(root.left,p,q);
+        }
+        else if(p.val>root.val && q.val>root.val){
+            return lowestCommonAncestor(root.right,p,q);
+        }
+        
+        return root;
+    }