题目描述
操作给定的二叉树,将其变换为源二叉树的镜像。
/**
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) {
}
}
解题思路
- 要排除当树为空的情况
- 交叉左右子树的位置
- 使用递归直到左右子树为空
public class Solution {
public void Mirror(TreeNode root) {
if (root == null) {
return;
}
if (root.left==null && root.right==null){
return;
}
TreeNode mTemp = root.left;
root.left = root.right;
root.right = mTemp;
if (root.left != null) {
Mirror(root.left);
}
if (root.right!=null){
Mirror(root.right);
}
}
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
}