236. Lowest Common Ancestor of a Binary Tree

最新推荐文章于 2022-02-13 02:31:00 发布

花好月圆19

最新推荐文章于 2022-02-13 02:31:00 发布

阅读量276

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/u010455041/article/details/50373203

版权

leetcode 专栏收录该内容

126 篇文章 0 订阅

订阅专栏

题目：

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.

解题思路：

极为精妙的递归解法，膜拜吧！

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root==NULL)
            return root;
        if(root==p||root==q)
            return root;
        TreeNode* l = lowestCommonAncestor(root->left, p, q);
        TreeNode* r = lowestCommonAncestor(root->right, p, q);
        if(l&&r) return root;
        return l ? l:r;
    }
};