题目描述:给定一个二叉树, 找到该树中两个指定节点的最近公共祖先。![在这里插入图片描述](https://img-blog.csdnimg.cn/20200902230633772.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2xfY19jX2M=,size_16,color_FFFFFF,t_70#pic_center)
![在这里插入图片描述](https://img-blog.csdnimg.cn/20200902230711805.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2xfY19jX2M=,size_16,color_FFFFFF,t_70#pic_center)
解题思路:(1)在root的左子树和右子树同时找p和q,若p和q分别分布在root的左右子树,则root为所求。(2)若左子树返回NULL,则说明p和q都在右子树,则进入右子树做1。(3) 若右子树返回NULL,则说明p和q都在左子树,则进入左子树左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==NULL||root==p||root==q) return root;
TreeNode*left=lowestCommonAncestor(root->left,p,q);
TreeNode*right=lowestCommonAncestor(root->right,p,q);
if(left==NULL) return right;
if(right==NULL) return left;
return root;
}
};