原题链接:Leecode 235. 二叉搜索树的最近公共祖先
代码一:
/**
* 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) {
if(!root) return NULL;
if(root==p || root==q) return root;
TreeNode* l; TreeNode* r;
if ( (p->val<root->val && q->val>root->val) || (p->val>root->val && q->val<root->val) )
return root;
else if(p->val<root->val && q->val<root->val)
{
l=lowestCommonAncestor(root->left,p,q);
r=NULL;
}
else
{
l=NULL;
r=lowestCommonAncestor(root->right,p,q);
}
if(!l) return r;
if(!r) return l;
if(l && r) return root;
return NULL;
}
};
代码二:
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
while(root)
{
if(p->val < root->val && q->val < root->val )
root=root->left;
else if(p->val > root->val && q->val > root->val )
root=root->right;
else break;
}
return root;
}
};