剑指Offer27 – 二叉树的镜像
题目:
请完成一个函数,输入一个二叉树,该函数输出它的镜像。
例如输入:
4
/ \
2 7
/ \ / \
1 3 6 9
镜像输出:
4
/ \
7 2
/ \ / \
9 6 3 1
示例 1:
输入:root = [4,2,7,1,3,6,9]
输出:[4,7,2,9,6,3,1]
限制:
0 <= 节点个数 <= 1000
代码:
package com.xujinshan.offer.offer27;
/**
* @Author: xujinshan361@163.com
* 剑指Offer27 -- 二叉树的镜像
* 请完成一个函数,输入一个二叉树,该函数输出它的镜像。
* <p>
* 例如输入:
* <p>
* 4
* / \
* 2 7
* / \ / \
* 1 3 6 9
* 镜像输出:
* <p>
* 4
* / \
* 7 2
* / \ / \
* 9 6 3 1
* <p>
* 示例 1:
* <p>
* 输入:root = [4,2,7,1,3,6,9]
* 输出:[4,7,2,9,6,3,1]
* <p>
* 限制:
* <p>
* 0 <= 节点个数 <= 1000
*/
import java.util.LinkedList;
import java.util.Queue;
/**
* Definition for a binary tree node.
*/
class TreeNode {
int val;
TreeNode left;
TreeNode right;
public TreeNode(int val) {
this.val = val;
}
public TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
}
/**
* 递归实现
*/
class Solution {
public TreeNode mirrorTree(TreeNode root) {
if (root == null) {
return null;
}
// 递归调用,镜像翻转左右子树
TreeNode cur = root.left;
root.left = mirrorTree(root.right);
root.right = mirrorTree(cur);
return root;
}
}
public class Offer27 {
public static void main(String[] args) {
TreeNode root = new TreeNode(4, new TreeNode(2, new TreeNode(1),
new TreeNode(3)), new TreeNode(7, new TreeNode(6), new TreeNode(9)));
new Solution().mirrorTree(root);
levelTraversal(root);
}
/**
* 二叉树的层次遍历
*/
private static void levelTraversal(TreeNode root) {
if (root == null) {
return;
}
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
while (!queue.isEmpty()) {
TreeNode cur = queue.remove();
System.out.println(cur.val+"\t");
if (cur.left != null) {
queue.add(cur.left);
}
if (cur.right != null) {
queue.add(cur.right);
}
}
}
}