C++代码:
if(root==NULL||root==p||root==q)
return root;
else
{
TreeNode*left=lowestCommonAncestor(root->left,p,q);
TreeNode*right=lowestCommonAncestor(root->right,p,q);
if(left&&right)
return root;
return left?left:right;
}
递归