/**
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 tmp = root.left;
root.left = root.right;
root.right = tmp;
//将子节点作为根节点进行递归调用,直到遍历到叶子节点为null
Mirror(root.left);
Mirror(root.right);
}
}
}
二叉树变换为源二叉树的镜像
最新推荐文章于 2021-11-09 13:38:03 发布