LeetCode 之 Lowest Common Ancestor of a Binary Search Tree

原创 2015年11月21日 18:31:52

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

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

        _______6______
       /              \
    ___2__          ___8__
   /      \        /      \
   0      _4       7       9
         /  \
         3   5

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

这个题我想了好久,目前只想到了递归的解决方法,代码如下:

class Solution {
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 NULL;
        else if(left!=NULL&&right!=NULL)
            return root;
        else
            return left?left:right;
    }
};
大致的思路如下:

对于某个节点A,有三种情况:

1>为空,返回空;

2>为p,q中的某一个,说明A节点肯定在LCA到p和q的两条路径中的某一个,返回A;

3>对A的左右孩子递归使用函数,得到left和right,此时又分三种情况;

3.1>left和right都为空,说明A肯定不再LCA到p和q的路径上,返回空;

3.2>left和right都不为空,说明A是p,q的lowest common ancestor ,返回A;

3.3>left和right中一个为空,一个不为空。返回不为空的节点,因为不为空说明该节点肯定在LCA到p和q的路径上。

代码行数比较多,我看到有4行代码解决的。其实他的意思和我的一样,懒得压缩了,而且感觉我这样写挺直观的,有空在想下非递归的方法。

相关文章推荐

[LeetCode]235. Lowest Common Ancestor of a Binary Search Tree

Problem DescriptionGiven a binary search tree (BST), find the lowest common ancestor (LCA) of two gi...

《leetCode》:Lowest Common Ancestor of a Binary Search Tree

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

[leetcode] 235.Lowest Common Ancestor of a Binary Search Tree

题目: Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in t...

LeetCode Lowest Common Ancestor of a Binary Search Tree

题目: Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes ...

LeetCode 235. Lowest Common Ancestor of a Binary Search Tree 二叉搜索树

235. Lowest Common Ancestor of a Binary Search Tree Given a binary search tree (BST), find the low...

LeetCode 235 Lowest Common Ancestor of a Binary Search Tree(二叉搜索树的最小公共祖先)

翻译给定一个二叉搜索树(BST),找出两个给定节点的最小公共祖先(LCA)。根据维基百科对于LCA的定义:“最小公共祖先的定义是对于两个节点v和s有一个最小的节点T, 以至于v和s都是T的后代(其中我...
  • NoMasp
  • NoMasp
  • 2016年01月12日 19:21
  • 1903

【LeetCode】Lowest Common Ancestor of a Binary Search Tree 解题报告

Lowest Common Ancestor of a Binary Search Tree[LeetCode]https://leetcode.com/problems/lowest-common-...

Leetcode:235. Lowest Common Ancestor of a Binary Search Tree(JAVA)

【问题描述】 Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nod...

leetcode-235-Lowest Common Ancestor of a Binary Search Tree

Lowest Common Ancestor of a Binary Search Tree Given a binary search tree (BST), find the lowes...

leetcode -- 235. Lowest Common Ancestor of a Binary Search Tree【区间,二叉搜索树特点】

题目 Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in th...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:LeetCode 之 Lowest Common Ancestor of a Binary Search Tree
举报原因:
原因补充:

(最多只允许输入30个字)