利用二叉搜索树的特性左子树的值都比根节点小,右子树的值都比根节点大这一特点来做就好了
/**
* 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(root)
{
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
return root;
}
return NULL;
}
};