LeetCode：剑指 Offer 27. 二叉树的镜像
树的遍历
将左右子树交换即可
class Solution {
public TreeNode
mirrorTree(TreeNode root
) {
if(root
== null
) return null
;
TreeNode right
= root
.left
;
root
.left
= root
.right
;
root
.right
= right
;
mirrorTree(root
.left
);
mirrorTree(root
.right
);
return root
;
}
}
