236. 二叉树的最近公共祖先（DFS ，清晰图解）235. 二叉搜索树的最近公共祖先

 

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
//从上往下搜索如果当前节点在[p,q]之间，就是根节点
class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root == null) return null;
        if( q.val>p.val ){
            if(root.val<=q.val && root.val>=p.val) return root; 
        }
        if( root.val<=p.val && root.val>=q.val) return root;   
        TreeNode left = lowestCommonAncestor(root.left,p,q);
        TreeNode right = lowestCommonAncestor(root.right,p,q);

        return left==null ? right:left; 
    }
}

 

 

 //后续遍历，自带回朔，从下倒上
class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
           //从root向下递归，如果遇到根节点或者p,q就返回
            if(root == null || root == p || q == root) return root;
            // 在root的left找到了，null就是没有
            TreeNode left=  lowestCommonAncestor(root.left,p,q);
            TreeNode right =  lowestCommonAncestor(root.right,p,q);
            // 如果找到一个节点，发现左子树出现结点p，右子树出现节点q，
            // 或者左子树出现结点q，右子树出现节点p，那么该节点就是节点p和q的最近公共祖先。
            if(left!=null && right!=null) return root;
            //都在左边，而右边没有
            if(left!=null && right==null) return left;
            //都在右边，而左边没有
            else if(left==null && right!=null) return right;
            return null;
    }
}

class Solution:
    def lowestCommonAncestor(self, root: TreeNode, p: TreeNode, q: TreeNode) -> TreeNode:
        if not root or root == p or root == q: 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


作者：jyd
链接：https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/solution/236-er-cha-shu-de-zui-jin-gong-gong-zu-xian-hou-xu/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。

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 null; // 1.
        if(left == null) return right; // 3.
        if(right == null) return left; // 4.
        return root; // 2. if(left != null and right != null)
    }
}


作者：jyd
链接：https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/solution/236-er-cha-shu-de-zui-jin-gong-gong-zu-xian-hou-xu/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。