代码实现:
public class Solution {
public int lowestCommonAncestor (TreeNode root, int p, int q) {
//空树没有祖先
if(root == null) return -1;
//如果pq在root两边则root为最近父类
if((p >= root.val && q <= root.val) || (p <= root.val && q >= root.val))
return root.val;
//如果都小于root则在左边
else if(p <= root.val && q <= root.val)
return lowestCommonAncestor(root.left,p,q);
//如果都大于root在右边
else
return lowestCommonAncestor(root.right,p,q);
}
}