思路:直接左右互换然后递归就好了
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
public class Solution {
public void Mirror(TreeNode root) {
TreeNode tmp = null;
if (root != null)
{
tmp = root.left;
root.left = root.right;
root.right = tmp;
if (root.left != null)
Mirror(root.left);
if (root.right != null)
Mirror(root.right);
}
}
}