题目描述
操作给定的二叉树,将其变换为源二叉树的镜像。
例如: 源二叉树 镜像二叉树 8 8 / \ / \ 6 10 10 6 / \ / \ / \ / \ 5 7 9 11 11 9 7 5
/**
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;
}
if (root.left == null && root.right == null) {
return;
}
TreeNode tmp = root.left;
root.left = root.right;
root.right = tmp;
if (root.left != null) {
Mirror(root.left);
}
if (root.right != null) {
Mirror(root.right);
}
}
}