剑指Offer(牛客网) 二叉树的镜像

Posted 2023-01-21

来源：
​​​ https://www.nowcoder.com/practice/564f4c26aa584921bc75623e48ca3011?tpId=13&tqId=11171&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking​​​ 题目描述
操作给定的二叉树，将其变换为源二叉树的镜像。
输入描述:
二叉树的镜像定义：源二叉树

8
   /  \\
  6   10
 / \\  / \\
5  7 9 11
镜像二叉树
    8
   /  \\
  10   6
 / \\  / \\
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 ;
         Mirror(root.left);//遍历左子树
        Mirror(root.right);//遍历右子树
        //交换左右节点
        TreeNode temp = root.left;
        root.left = root.right;
        root.right = temp;