/**
* 自己的代码
* 对于每一个root,如果就是p(q),直接return自身(若q(p)在自己的子树中,则自己就是LCA)
* 如果p、q分别在自己的左右子树,则它们的LCA是自己
* 否则LCA在自己的子树中,递归查找左右子树,返回不为空的值就是找到的LCA
* Runtime: 4 ms, faster than 100.00%
* Memory Usage: 41.4 MB, less than 15.85%
*/
class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if (root == null || root == p || root == q) {
return root;
}
TreeNode left = lowestCommonAncestor(root.left, p, q);
TreeNode right = lowestCommonAncestor(root.right, p, q);
if (left != null && right != null) {
return root;
}
return left == null ? right : left;
}
}