题目链接:
递归交换左右部分
public class Solution {
public void Mirror(TreeNode root) {
if(root == null){
return;
}
TreeNode tmp;
tmp = root.left;
root.left = root.right;
root.right = tmp;
Mirror(root.left);
Mirror(root.right);
}
}