题目描述:
代码如下:
class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if (root == null) {
return null;
}
//一个结点也可以是它自己的祖先
if (root == p || root == q) {
return root;
}
TreeNode left = lowestCommonAncestor(root.left, p, q);
TreeNode right = lowestCommonAncestor(root.right, p, q);
//p、q结点分别在root的左右两边
if(left!=null&&right!=null){
return root;
}
//都在左边
if(left!=null){
return left;
}
//都在右边
if(right!=null){
return right;
}
return null;
}
}