Lowest Common Ancestor of a Binary Search Tree leetcode235

最新推荐文章于 2022-07-15 17:44:43 发布

bae_

最新推荐文章于 2022-07-15 17:44:43 发布

阅读量287

点赞数

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

本文链接：https://blog.csdn.net/majesty_/article/details/46842355

版权

leetcode 专栏收录该内容

21 篇文章 0 订阅

订阅专栏

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.

题目意思是在给定的二分查找树找出给定两个节点p，q的最小共同祖先（lowest common ancestor (LCA)）

因为二分查找树的特性，任一子树的左节点小于根节点，其右节点大于根节点。从根节点root向下寻找，如果p，q的val同时大于root的val，说明需要求的LCA 则在root的右子树上，反之p，q的val小于roo的val，则LCA在root的左子树上。

/**
 * 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) {
      while(true){
        if(p->val>root->val&&q->val>root->val)
            root=root->right;
        else if(p->val<root->val&&q->val<root->val)
            root=root->left;
        else return root;
      } 
    }
};

贴一个三行的答案：

/**
 * 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) {

      while((p->val-root->val)*(q->val-root->val)>0)
          root=p->val>root->val?root->right:root->left;
      return root;
    }
};