面试题19：二叉树的镜像

/*递归方法*/
void transferByRecursion(BSTreeNode * node)
{
if(node==NULL)
{
return;
}
else
{
BSTreeNode * temp=node->left;
node->left=node->right;
node->right=temp;

if(node->left!=NULL)
{
transferByRecursion(node->left);
}

if(node->right!=NULL)
{
transferByRecursion(node->right);
}
}
}