//这里仅写部分代码了
class BiTree{
int val;
BiTree left;
BiTree right;
};//二叉树结构定义
void mirro(BiTree T)
{
if(T==NULL)
return NULL;
if(T->left==NULL&&T->right==NULL)
return ;
BiTree temp = T->left;
T->left = T->right;
T->right = temp;
if(T->left)
mirro(T->left);
if(T->right)
mirro(T->right);
}