题目描述
操作给定的二叉树,将其变换为源二叉树的镜像。(即二叉树的每个节点的左右子树相反)
解法一(递归)
/**
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) {
TreeNode tmp;
if (root!=null){
tmp = root.left;
root.left = root.right;
root.right = tmp;
if(root.left!=null)
Mirror(root.left);
if(root.right!=null)
Mirror(root.right);
}
}
}
解法二(非递归)
循环遍历二叉树的每个节点,颠倒