剑指 Offer 68 - I. 二叉搜索树的最近公共祖先 - 力扣(LeetCode) (leetcode-cn.com)
class Solution {
TreeNode*res=nullptr;
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if(root==nullptr) return nullptr;
fun(root,p,q);
return res;
}
void fun(TreeNode*root,TreeNode*p,TreeNode*q){
if(root==nullptr) return;
if(root->val<min(p->val,q->val)) fun(root->right,p,q);
else if(root->val>max(p->val,q->val)) fun(root->left,p,q);
else if(root->val>=min(p->val,q->val)&&root->val<=max(p->val,q->val)) res=root;
}
};