请完成一个函数,输入一个二叉树,该函数输出它的镜像。
public static void mirror(TreeNode treeNode) {
if (treeNode == null) return;
if (treeNode.left == null && treeNode.right == null) return;
TreeNode temp = treeNode.left;
treeNode.left = treeNode.right;
treeNode.right = temp;
if (treeNode.left != null) {
mirror(treeNode.left);
}
if (treeNode.right != null) {
mirror(treeNode.right);
}
}
public class TreeNode {
public int data;
public TreeNode left;
public TreeNode right;
public TreeNode(int data) {
this.data = data;
}
@Override
public String toString() {
return "TreeNode{" +
"data=" + data +
", left=" + left +
", right=" + right +
'}';
}
}