[Java]Leetcode236 Lowest Common Ancestor of a Binary Tree

最新推荐文章于 2024-01-20 11:36:22 发布

青人

最新推荐文章于 2024-01-20 11:36:22 发布

阅读量1.3k

点赞数

分类专栏：算法 LeetCode Java解题集合

本文链接：https://blog.csdn.net/fumier/article/details/47903037

版权

算法同时被 2 个专栏收录

39 篇文章 0 订阅

订阅专栏

LeetCode Java解题集合

29 篇文章 2 订阅

订阅专栏

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes v and w as the lowest node in T that has both v and w as descendants (where we allow a node to be a descendant of itself).”

        _______3______
       /              \
    ___5__          ___1__
   /      \        /      \
   6      _2       0       8
         /  \
         7   4

For example, the lowest common ancestor (LCA) of nodes 5 and 1 is 3. Another example is LCA of nodes 5 and 4 is 5, since a node can be a descendant of itself according to the LCA definition.

 题意：之前一题的树是二叉查找树，而本题的树就是一棵普通的二叉树。给定两个节点，判断这两个节点的相同的父节点。父节点也有可能是两个节点其中之一。这一题，感觉用递归方法解题更简单。

解题思路：先遍历左子树，返回匹配的点，没有返回null。后遍历右子树，返回匹配的点，没有返回null。如果left和right都不为null，则根节点是它们的共同节点。如果left为空，则两个节点都在右子树，返回right。如果right为空，则两个节点都在左子树，返回left.

 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;
    }