@@ -0,0 +1,574 @@
+/**%0A * Definition for a binary tree node.%0A * public class TreeNode %7B%0A *     int val;%0A *     TreeNode left;%0A *     TreeNode right;%0A *     TreeNode(int x) %7B val = x; %7D%0A * %7D%0A */%0A%0Apublic class Solution %7B%0A%0A    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) %7B%0A%0A        if (root.val %3E p.val && root.val %3E q.val) %7B%0A            return lowestCommonAncestor(root.left, p, q);%0A        %7D else if (root.val %3C p.val && root.val %3C q.val) %7B%0A            return lowestCommonAncestor(root.right, p, q);%0A        %7D else %7B%0A            return root;%0A        %7D%0A%0A    %7D%0A%0A%7D%0A

Create : 235 Lowest Common Ancestor of a Binary Search Tree