用递归的方法来做,很简单
public class Solution {
public void Mirror(TreeNode root) {
if(root == null){
return ;
}
TreeNode tmp = root.left;
root.left = root.right;
root.right = tmp;
Mirror(root.left);
Mirror(root.right);
}
}