Lowest Common Ancestor III

update Jul 14, 2017 16:00

LintCode LeetCode: leetcode 中的版本没有考虑 two node 不存在树中的情况。

Given the root and two nodes in a Binary Tree. Find the lowest common ancestor(LCA) of the two nodes. The lowest common ancestor is the node with largest depth which is the ancestor of both nodes. Return null if LCA does not exist.

Notice

node A or node B may not exist in tree.

Example

    For the following binary tree:

        4
       / \
      3   7
         / \
        5   6

    LCA(3, 5) = 4

    LCA(5, 6) = 7

    LCA(6, 7) = 7

Basic Idea:

两个given node，A, B。helper函数遇到其中之一的时候即返回它，如果左右node的返回值都不为空，即说明当前node为LCA，返回当前node。这样也可以解决两node其中之一是LCA的情况。但是考虑到有可能LCA不存在，我们设定两个boolean分别表示我们找到了A或B，如果最终两者不全为true，则返回null。

Java Code:

    public class Solution {
        /*
         * @param root: The root of the binary tree.
         * @param A: A TreeNode
         * @param B: A TreeNode
         * @return: Return the LCA of the two nodes.
         */
        private boolean A_appear;
        private boolean B_appear;
        public TreeNode lowestCommonAncestor3(TreeNode root, TreeNode A, TreeNode B) {
            TreeNode ret = helper(root, A, B);
            if (A_appear && B_appear) return ret;
            else return null;
        }

        private TreeNode helper(TreeNode root, TreeNode A, TreeNode B) {
            if (root == null) return null;
            TreeNode left = helper(root.left, A, B);
            TreeNode right = helper(root.right, A, B);
            if (root == A && root == B) {
                A_appear = true;
                B_appear = true;
                return root;
            } else if (root == A) {
                A_appear = true;
                return root;
            } else if (root == B) {
                B_appear = true;
                return root;
            } else if (left != null && right != null) {
                return root;
            } else {
                return left != null ? left : right;
            }
        }
    }

update Aug 27, 2017 16:08

更新python的解，对上面的java解法进一步简化，完全的按照可能出现的情况分情况讨论，思路更加自然；

Python

    class Solution:
        """
        @param: root: The root of the binary tree.
        @param: A: A TreeNode
        @param: B: A TreeNode
        @return: Return the LCA of the two nodes.
        """
        def lowestCommonAncestor3(self, root, A, B):
            def helper(root, A, B):
                if not root:
                    return None
                left = helper(root.left, A, B)
                right = helper(root.right, A, B)
                if root is A and root is B:
                    self.flag = [True] * 2
                    return root
                if root is A:
                    self.flag[0] = True
                    return root
                if root is B:
                    self.flag[1] = True
                    return root
                if left and right: # 左右不为空，root为LCA
                    return root
                # 否则的话返回左右中不为空的
                return left if left else right


            self.flag = [False] * 2
            ret = helper(root, A, B)
            if self.flag[0] and self.flag[1]:
                return ret
            else:
                return None

update Dec 20,2017 1:31

Update

这种写法很暴力地用判断语句枚举了各种情况，也比较符合 intuition; Java Code:

    public class Solution {
        /*
         * @param root: The root of the binary tree.
         * @param A: A TreeNode
         * @param B: A TreeNode
         * @return: Return the LCA of the two nodes.
         */
        private TreeNode ret;
        public TreeNode lowestCommonAncestor3(TreeNode root, TreeNode p, TreeNode q) {
            helper(root, p, q);
            return ret;
        }

        private TreeNode helper(TreeNode root, TreeNode p, TreeNode q) {
            if (root == null) return null;
            TreeNode left = helper(root.left, p, q);
            TreeNode right = helper(root.right, p, q);
            // 如果 p==q，自己是 ancestor
            if (p == q && p == root) {
                ret = root;
                return null;
            // 如果 root, left, right 中有 p 和 q，则说明root就是LCA
            } else if (root == p && (left == q || right == q) ||
                root == q && (left == p || right == p) ||
                left != null && right != null) {
                ret = root;
                return null;
            } else if (root == p || left == p || right == p){
                return p;
            } else if (root == q || left == q || right == q) {
                return q;
            } else {
                return null;
            }
        }
    }

update 2018-06-29 16:33:14

Update, Leetcode 版本简便解法

如果不考虑comment ancestor不存在的情况，其实只要保证如下规则就可以： 1. 如果当前root为 p 或者 q，直接返回； 2. 如果左右返回都不为null，则返回当前 root，说明当前root即为所求的ancestor； 3. 如果左右返回值都为null，则返回null； 4. 否则，返回两者中不为null的；

class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if (root == null) return null;
        if (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 ? left : right;
    }
}