lintcode-medium-Lowest Common Ancestor

最新推荐文章于 2024-06-02 16:09:57 发布

转载最新推荐文章于 2024-06-02 16:09:57 发布 · 68 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/goblinengineer/p/5333737.html

本文介绍了一种寻找二叉树中两个节点的最低公共祖先（LCA）的方法。通过递归遍历二叉树，当左右子树分别找到目标节点之一时，则当前节点即为最低公共祖先。

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.

Example

For the following binary tree:

LCA(3, 5) = 4

LCA(5, 6) = 7

LCA(6, 7) = 7

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root: The root of the binary search tree.
     * @param A and B: two nodes in a Binary.
     * @return: Return the least common ancestor(LCA) of the two nodes.
     */
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode A, TreeNode B) {
        // write your code here
        
        if(root == null)
            return null;
        if(A == null)
            return B;
        if(B == null)
            return A;
        
        if(root == A || root == B)
            return root;
        
        TreeNode left = lowestCommonAncestor(root.left, A, B);
        TreeNode right = lowestCommonAncestor(root.right, A, B);
        
        if(left == null && right != null)
            return right;
        else if(left != null && right == null)
            return left;
        else if(left != null && right != null)
            return root;
        else
            return null;
    }
    

}

转载于:https://www.cnblogs.com/goblinengineer/p/5333737.html