leetcode[236]:Lowest Common Ancestor of a Binary Tree

最新推荐文章于 2022-03-12 17:26:01 发布

hahubaba

最新推荐文章于 2022-03-12 17:26:01 发布

阅读量246

点赞数

分类专栏： leetcode 文章标签： binary tree

本文链接：https://blog.csdn.net/hahubaba/article/details/46954879

版权

leetcode 专栏收录该内容

86 篇文章 0 订阅

订阅专栏

Lowest Common Ancestor of a Binary 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).”

     _______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;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
struct TreeNode* lowestCommonAncestor(struct TreeNode* root, struct TreeNode* p, struct TreeNode* q) {

    struct TreeNode *leftt, *rightt;
    if(!root || root==p || root==q) return root;
    leftt = lowestCommonAncestor(root->left, p, q);
    rightt = lowestCommonAncestor(root->right, p, q);    
    if(leftt&&rightt) return root;
    if(leftt) return leftt;
    if(rightt) return rightt;

}

左右都找到说明共同节点是根节点，否则就是找到的那个节点。
开始使用val比较，发现WA，错误示例是有数值一样的节点，改成直接比较节点后AC。

参考：My 4-lines Java solution