class Solution {

public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {

if(root.val>java.lang.Math.max(p.val,q.val))

return lowestCommonAncestor(root.left,p,q);

if(root.val<java.lang.Math.min(p.val,q.val))

return lowestCommonAncestor(root.right,p,q);

else

return root;

}

}