235. 二叉搜索树的最近公共祖先 - 力扣(LeetCode)
递归
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if(root == p || root == q) return root;
//去右子树检索
if(root->val < p->val && root->val < q->val) return lowestCommonAncestor(root->right, p, q);
//去左子树检索
if(root->val > p->val && root->val > q->val) return lowestCommonAncestor(root->left, p, q);
//p, q一个在左边,一个在右边,则最近的祖先就是当前root
return root;
}
};
迭代
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if(root == p || root == q) return root;
auto cur = root;
while(cur){
if(cur->val < p->val && cur->val < q->val) cur = cur->right;
if(cur->val > p->val && cur->val > q->val) cur = cur->left;
else return cur;
}
return root;
}
};