题目描述
操作给定的二叉树,将其变换为源二叉树的镜像。
题解
思路:交换左右子树即可,为空直接返回即可
/**
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){
return;
}
TreeNode temp = root.left;
root.left = root.right;
root.right = temp;
Mirror(root.left);
Mirror(root.right);
}
}
变形
判断两颗二叉树是不是镜像二叉树
public static boolean isMirrorRec(TreeNode r1, TreeNode r2){
// 如果两个树都是空树,则返回true
if(r1==null && r2==null){
return true;
}
// 如果有一棵树是空树,另一颗不是,则返回false
if(r1==null || r2==null){
return false;
}
// 如果两个树都非空树,则先比较根节点
if(r1.val != r2.val){
return false;
}
// 递归比较r1的左子树的镜像是不是r2右子树 和
// r1的右子树的镜像是不是r2左子树
return isMirrorRec(r1.left, r2.right) && isMirrorRec(r1.right, r2.left);
}
变形2
给定一个二叉树,检查它是否是镜像对称的
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public boolean isSymmetric(TreeNode root) {
return isMirror(root, root);
}
public boolean isMirror(TreeNode t1, TreeNode t2) {
if (t1 == null && t2 == null) return true;
if (t1 == null || t2 == null) return false;
return (t1.val == t2.val)
&& isMirror(t1.right, t2.left)
&& isMirror(t1.left, t2.right);
}
}