剑指 Offer 68 - I. 二叉搜索树的最近公共祖先
给定一个二叉搜索树, 找到该树中两个指定节点的最近公共祖先。
百度百科中最近公共祖先的定义为:“对于有根树 T 的两个结点 p、q,最近公共祖先表示为一个结点 x,满足 x 是 p、q 的祖先且 x 的深度尽可能大(一个节点也可以是它自己的祖先)。”
例如,给定如下二叉搜索树:
测试用例① root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 8
测试用例② root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 4
思路1:递归
/**
* 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==nullptr || p==nullptr || q==nullptr)
return nullptr;
if(root->val > p->val && root->val > q->val){
root = lowestCommonAncestor(root->left,p,q);
}else if(root->val < p->val && root->val < q->val){
root = lowestCommonAncestor(root->right,p,q);
}
return root; //p,q分别在root左右两边;p==root;q==root
}
};
思路2:迭代
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if(root==nullptr || p==nullptr || q==nullptr)
return nullptr;
while(root!=nullptr){
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; //p,q分别在root左右两边;p==root;q==root
}
};
剑指 Offer 68 - II. 二叉树的最近公共祖先
给定一个二叉树, 找到该树中两个指定节点的最近公共祖先。
/**
* 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==nullptr || p==nullptr || q==nullptr)
return nullptr;
list<TreeNode*> path1;
getNodePath(root,p,path1);
list<TreeNode*> path2;
getNodePath(root,q,path2);
return getLowestCommonNode(path1,path2);
}
bool getNodePath(TreeNode* root, TreeNode* node, list<TreeNode*>& path){
path.push_back(root);
if(root==node)
return true;
bool found=false;
if(!found && root->left!=nullptr)
found=getNodePath(root->left,node,path);
if(!found && root->right!=nullptr)
found=getNodePath(root->right,node,path);
if(!found)
path.pop_back();
return found;
}
TreeNode* getLowestCommonNode(const list<TreeNode*>& path1, const list<TreeNode*>& path2){
TreeNode* pLowest = nullptr;
list<TreeNode*>::const_iterator i1=path1.begin();
list<TreeNode*>::const_iterator i2=path2.begin();
while(i1 != path1.end() && i2 != path2.end()){
if(*i1 == *i2)
pLowest=*i1;
i1++;
i2++;
}
return pLowest;
}
};