二叉树的最近公共祖先

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

例如，给定如下二叉树: root = [3,5,1,6,2,0,8,null,null,7,4]

package factory;


import base.TreeNode;

/**
 * @Auther: Jaryn
 * @Date: 2019/12/10 22:43
 * @Description: 二叉树的最近公共祖先
 * https://leetcode-cn.com/explore/interview/card/top-interview-quesitons-in-2018/269/tree/1166/
 */
public class LowestCommonAncestor {

    public static void main(String[] args) {
        TreeNode treeNode3 = new TreeNode(3);
        TreeNode treeNode5 = new TreeNode(5);
        TreeNode treeNode6 = new TreeNode(6);
        TreeNode treeNode2 = new TreeNode(2);
        TreeNode treeNode7 = new TreeNode(7);
        TreeNode treeNode4 = new TreeNode(4);
        TreeNode treeNode1 = new TreeNode(1);
        TreeNode treeNode0 = new TreeNode(0);
        TreeNode treeNode8 = new TreeNode(8);

        treeNode3.setLeft(treeNode5);
        treeNode3.setRight(treeNode1);
        treeNode5.setLeft(treeNode6);
        treeNode5.setRight(treeNode2);
        treeNode2.setLeft(treeNode7);
        treeNode2.setRight(treeNode4);
        treeNode1.setLeft(treeNode0);
        treeNode1.setRight(treeNode8);

        System.out.println(lowestCommonAncestor(treeNode3, treeNode7, treeNode4).getVal());
    }


    /**
     * 递归查找
     * 如果【7，4】同一边左右，那么return root=2.即最终left = 2，right= null
     * 如果【5，1】不同边，那么left= 5， right = 1， return 3
     * 如果【6, 1】不同边，那么left = 6，right=1,return 3
     * 如果【6, 8】不同边，那么left = 6， right=8，return 3
     * 如果【5，4】同一边上下，那么left = 5，right = null，return 5
     * @param root
     * @param p
     * @param q
     * @return
     */
    public static TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root == null || root == p || root ==q ) {
            return root;
        }
        TreeNode left = lowestCommonAncestor(root.getLeft(), p, q);
        TreeNode right = lowestCommonAncestor(root.getRight(), p, q);
        if(left!= null && right != null) {
            return root;
        }else if(left != null) {
            return left;
        }else{
            return right;
        }
    }
}

[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-VQkas24Q-1584458171829)(http://www.jaryn.cn:8090/201912/1575992110138.png)]