递归实现如下:
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if(p.val>root.val&&q.val>root.val)
return lowestCommonAncestor(root.right,p,q);
else if(p.val<root.val&&q.val<root.val)
return lowestCommonAncestor(root.left,p,q);
return root;
}
Java for LeetCode 235 Lowest Common Ancestor of a Binary Search Tree
原文：http://www.cnblogs.com/tonyluis/p/4934291.html