235. Lowest Common Ancestor of a Binary Search Tree

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

According to the definition of LCA on Wikipedia: "The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself)."

Example 1:

复制代码
Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 8
Output: 6
Explanation: The LCA of nodes 2 and 8 is 6.

Example 2:

复制代码
Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 4
Output: 2
Explanation: The LCA of nodes 2 and 4 is 2, since a node can be a descendant of itself according to the LCA definition.

Example 3:

复制代码
Input: root = [2,1], p = 2, q = 1
Output: 2

Constraints:

  • The number of nodes in the tree is in the range [2, 105].
  • -109 <= Node.val <= 109
  • All Node.val are unique.
  • p != q
  • p and q will exist in the BST.

递归法:

复制代码
class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root->val>p->val && root->val>q->val){
            return lowestCommonAncestor(root->left,p,q);
        }
        else if(root->val<p->val && root->val<q->val){
            return lowestCommonAncestor(root->right,p,q);
        }
        else return root;
    }
};

注意:

第一步,如果root->val比pq都要大就递归左子树,反之递归右子树

第二步,如果不是上面两种(root就是最近公共祖先)就返回root

迭代:

复制代码
class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        while(root){
            if(root->val>p->val && root->val>q->val)root=root->left;
            else if(root->val<p->val && root->val<q->val)root=root->right;
            else return root;
        }
        return NULL;
    }
};

注意:

不要忘记最后一行的return NULL,又是被这么简短的迭代感动哭的一天

相关推荐
明朝百晓生几秒前
【强化学习】【1】【PyTorch】【强化学习简介优化框架】
算法
loser~曹6 分钟前
基于快速排序解决 leetcode hot215 查找数组中第k大的数字
数据结构·算法·leetcode
Dream it possible!12 分钟前
LeetCode 热题 100_打家劫舍(83_198_中等_C++)(动态规划)
c++·算法·leetcode·动态规划
zhouziyi070117 分钟前
【蓝桥杯14天冲刺课题单】Day 8
c++·算法·蓝桥杯
SylviaW0821 分钟前
python-leetcode 62.搜索插入位置
数据结构·算法·leetcode
丶Darling.22 分钟前
26考研 | 王道 | 数据结构 | 第四章 串
数据结构·考研·kmp
愚润求学1 小时前
【C++】vector常用方法总结
开发语言·c++·vector
赤秀2 小时前
C++模板初阶
开发语言·c++
舔甜歌姬的EGUMI LEGACY2 小时前
【算法day28】解数独——编写一个程序,通过填充空格来解决数独问题
算法
深圳厨神2 小时前
浅谈数据结构
数据结构