二叉树的镜像,递归即可
class Solution {
public TreeNode mirrorTree(TreeNode root) {
if(root==null) return null;
//交换左右子树
TreeNode temp = root.left;
root.left=root.right;
root.right=temp;
//递归
mirrorTree(root.left);
mirrorTree(root.right);
return root;
}
}