题目很简单。
由于是BST,则分三种情况考虑:
- root->val比p->val和q->val都大,则root左移
- root->val比p->val和q->val都小,则root右移
- root->val介于p->val与q->val之间,则root是p和q的公共祖先
/**
* 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 (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 {
break;
}
}
return root;
}
};
结果: