TreeNode *lowestCommonAncestor(TreeNode *root, TreeNode *A, TreeNode *B) {
if(!root)
return NULL;
if(root==A)
return A;
if(root==B)
return B;
TreeNode *L=lowestCommonAncestor(root->left,A,B);
TreeNode *R=lowestCommonAncestor(root->right,A,B);
if(L&&R)
return root;
return L?L:R;
}
二叉树的最近公共祖先
最新推荐文章于 2022-06-10 18:07:50 发布