递归交换root->left 与 root->right
class Solution {
public:
TreeNode* mirrorTree(TreeNode* root) {
if(!root)return nullptr;
swap(root->left,root->right);
mirrorTree(root->left);
mirrorTree(root->right);
return root;
}
};