二叉树的镜像

/**
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) {
        
         if (root != null) {           
            TreeNode trans = root.left;
            root.left = root.right;
            root.right = trans;
            Mirror(root.left);
            Mirror(root.right);
        }
           
        
    }
}