镜像二叉树 题目:注意不是对称二叉树,是镜像二叉树,左右节点交换 public TreeNode mirrorTree(TreeNode root) { if(root==null){ return root; } mirrorTree(root.left); mirrorTree(root.right); TreeNode temp = root.left; root.left = root.right; root.right = temp; return root; }