@@ -0,0 +1,586 @@
+package leetcode.lowest_common_ancestor_of_a_binary_search_tree;%0A%0Aimport common.TreeNode;%0A%0Apublic class Solution %7B%0A    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) %7B%0A        if(p.val %3E q.val)%7B%0A            TreeNode tmp = p;%0A            p = q;%0A            q = tmp;%0A        %7D%0A        if(root.val %3E= p.val && root.val %3C= q.val)%7B%0A            return root;%0A        %7Delse if(root.val %3E p.val && root.val %3E q.val)%7B%0A            return lowestCommonAncestor(root.left, p, q);%0A        %7Delse%7B%0A            return lowestCommonAncestor(root.right, p, q);%0A        %7D%0A    %7D%0A%7D

Add java solution for 235. Lowest Common Ancestor of a Binary Search Tree