236二叉树的最近公共祖先

二叉树的最近公共祖先

给定一个二叉树, 找到该树中两个指定节点的最近公共祖先。

百度百科中最近公共祖先的定义为：“对于有根树 T 的两个节点 p、q，最近公共祖先表示为一个节点 x，满足 x 是 p、q 的祖先且 x 的深度尽可能大（一个节点也可以是它自己的祖先）。”

 JAVA:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root==null||root==p||root==q) return root;

        boolean pInLeft=find(root.left,p)!=null;
        boolean pInRight=!pInLeft;

        boolean qInleft=find(root.left,q)!=null;
        boolean qInRight=!qInleft;

        if(pInLeft&&qInleft) return lowestCommonAncestor(root.left,p,q);
        if(pInRight&&qInRight) return lowestCommonAncestor(root.right,p,q);
        return root;
    }

    public TreeNode find(TreeNode root,TreeNode node){
        if(root==null||root==node) return root;
        TreeNode left=find(root.left,node);
        TreeNode right=find(root.right,node);
        return left==null?right:left;
    }
}

JAVA(优化1):

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root==null||root==p||root==q) return root;

        TreeNode pqInLeft=find(root.left,p,q);
        TreeNode pqInRight=find(root.right,p,q);

        if(pqInLeft==null) return lowestCommonAncestor(root.right,p,q);
        if(pqInRight==null) return lowestCommonAncestor(root.left,p,q);
        return root;
    }

    public TreeNode find(TreeNode root,TreeNode p,TreeNode q){
        if(root==null||root==p||root==q) return root;
        TreeNode left=find(root.left,p,q);
        TreeNode right=find(root.right,p,q);
        return left==null?right:left;
    }
}

JAVA(优化2):

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root==null||root==p||root==q) return root;

        TreeNode pqInLeft=lowestCommonAncestor(root.left,p,q);
        TreeNode pqInRight=lowestCommonAncestor(root.right,p,q);

        if(pqInLeft==null) return pqInRight;
        if(pqInRight==null) return pqInLeft;
        return root;
    }

}