【leetcode】Lowest Common Ancestor of a Binary Search Tree

最新推荐文章于 2024-09-24 08:39:28 发布

jimmybao0730

最新推荐文章于 2024-09-24 08:39:28 发布

阅读量361

点赞数

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

本文链接：https://blog.csdn.net/linglun3/article/details/46957951

版权

leetcode 专栏收录该内容

101 篇文章 0 订阅

订阅专栏

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

思路： 由于是二叉搜索树，因此左子树的值一定小于右子树。根据这个性质就可写出下面的算法。对比值，然后用递归的方法做。

/**
 * 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 || p==NULL || q==NULL)
            return NULL;

        if(root->val==p->val || root->val==q->val)
            return root;

        if(root->val < p->val && root->val < q->val)
            lowestCommonAncestor(root->right, p, q);
        else if(root->val > p->val && root->val > q->val)
            lowestCommonAncestor(root->left, p, q);
        else
            return root;
    }
};