class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if(!root || root == p || root == q)
return root;
TreeNode* left = lowestCommonAncestor(root->left,p,q);
TreeNode* right = lowestCommonAncestor(root->right,p,q);
if(!left)
return right;
if(!right)
return left;
if(right && left)
return root;
return nullptr;
}
};
二叉树的最近公共祖先
最新推荐文章于 2024-07-19 19:25:43 发布