class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q)
{
if(root == NULL || root == p || root == q)
return root;
TreeNode* l = lowestCommonAncestor(root->left, p, q);
TreeNode* r = lowestCommonAncestor(root->right, p, q);
if(l && r)
return root;
if(l)
return l;
else
return r;
}
};
Leetcode#236. 二叉树的最近公共祖先
最新推荐文章于 2021-08-13 21:40:19 发布