解法一
是有序的二叉树,左中右大小顺序。
/**
* 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) {
TreeNode * ancent = root;
while (true)
{
if(p->val>ancent->val && q->val >ancent->val) ancent=ancent->right;
else if(p->val < ancent->val && q->val <ancent->val) ancent = ancent->left;
else break;
}
return ancent;
}
};