/**
* 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==p||root==q||root==NULL)return root;
TreeNode*left=lowestCommonAncestor(root->left,p,q);
TreeNode*right =lowestCommonAncestor(root->right,p,q);
if(left!=NULL&&right!=NULL)return root;
if(left==NULL&&right!=NULL)return right;
else if(left!=NULL&&right==NULL)return left;
else return NULL;
}
};
236. 二叉树的最近公共祖先
最新推荐文章于 2024-08-09 20:36:57 发布