方法一:递归
public TreeNode mirrorTree(TreeNode root){
if(root==null) return null;
TreeNode left=mirrorTree(root.right);
TreeNode right=mirrorTree(root.left);
root.left=left;
root.right=right;
return root;
}
方法二:层次遍历
public TreeNode mirrorTree(TreeNode root){
if(root==null) return null;
Queue<TreeNode> queue=new LinkedList<>();
queue.add(root);
while(!queue.isEmpty()){
TreeNode node=queue.poll();
if(node.left!=null) queue.add(node.left);
if(node.right!=null) queue.add(node.right);
TreeNode temp=node.left;
node.left=node.right;
node.right=temp;
}
return root;
}