题目描述
请完成一个函数,输入一个二叉树,该函数输出它的镜像。
示例
输入:root = [4,2,7,1,3,6,9]
输出:[4,7,2,9,6,3,1]
思路
- BFS
- 递归
代码
解法1:采用递归进行处理
class Solution {
public TreeNode mirrorTree(TreeNode root) {
if(root == null) return root;
TreeNode temp = root.left;
root.left = mirrorTree(root.right);
root.right = mirrorTree(temp);
return root;
}
}
解法2: 采用BFS从上往下对树进行处理,交换左右孩子结点。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode mirrorTree(TreeNode root) {
if(root == null) return root;
Queue<TreeNode> q = new LinkedList<>();
q.add(root);
while(!q.isEmpty()) {
for(int i = q.size(); i > 0; i--) {
TreeNode node = q.poll();
TreeNode temp = node.left;
node.left = node.right;
node.right = temp;
if(node.right != null) q.add(node.right);
if(node.left != null) q.add(node.left);
}
}
return root;
}
}