68 - II. 二叉树的最近公共祖先(lowestCommonAncestor)

68 - II. 二叉树的最近公共祖先(lowestCommonAncestor)

1. python

class Solution:
    def lowestCommonAncestor(self, root: TreeNode, p: TreeNode, q: TreeNode) -> TreeNode:
        if not root or p==root or q == root:
            return root
        left = self.lowestCommonAncestor(root.left,p,q)
        right = self.lowestCommonAncestor(root.right,p,q)
        if not left:
            return right
        if not right:
            return left
        return root

---

2. Java

class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root ==null|| p ==root ||q ==root){
            return root;
        }
        TreeNode left = lowestCommonAncestor(root.left,p,q);
        TreeNode right = lowestCommonAncestor(root.right,p,q);

        if (left==null){
            return right;
        }
        if(right == null){
            return left;
        }
        return root; 
    }
}

---