原题链接:https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof/
1、递归
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
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);
return root;
}
2、迭代
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
while (root != NULL) {
if (root->val < p->val && root->val < q->val) root = root->right;
else if (root->val > p->val && root->val > q->val) root = root->left;
else break;
}
return root;
}