Leetcode 236. Lowest Common Ancestor of a Binary Tree

最新推荐文章于 2024-10-15 19:28:18 发布

TooSchoolForCool

最新推荐文章于 2024-10-15 19:28:18 发布

阅读量214

点赞数

分类专栏： LeetCode 文章标签： LeetCode 算法面试树 LCA

本文链接：https://blog.csdn.net/Zzy_ZhangZeyu_/article/details/79694634

版权

LeetCode 专栏收录该内容

11 篇文章 0 订阅

订阅专栏

Leetcode 236. Lowest Common Ancestor of a Binary Tree

@(LeetCode)[LeetCode, Algorithm, Tree]

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).”

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.

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

Solution #1

Time: $O(n)$
Space: $O(n)$

Given a node node
- If p and q appeared on its both sides, then node must be the LCA
- If p or q only appear on one of its sides, then that p or q must be the LCA.

这道题的解法关键在于要想清楚两点：
1. 如果p 和q同时出现在了两侧，那么这个节点就一定是LCA
2. 如果p 和q中只有一个出现在了某一侧，那么出现了的那个就是LCA

class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(!root || root == p || root == q)
            return root;

        TreeNode *left = lowestCommonAncestor(root->left, p, q);
        TreeNode *right = lowestCommonAncestor(root->right, p, q);

        return !left ? right : !right ? left : root;
    }
};