Day7：剑指 Offer 27. 二叉树的镜像

题目

请完成一个函数，输入一个二叉树，该函数输出它的镜像。

代码实现

递归实现

package Day22;

/**
 * 剑指 Offer 27. 二叉树的镜像
 * @Author laimouren
 * @Date 2021/12/13 14:30
 */
public class Solution2 {
    public TreeNode mirrorTree(TreeNode root) {
        if(root == null){
            return root;
        }
        TreeNode node = root.left;
        root.left = mirrorTree(root.right);
        root.right = mirrorTree(node);
        return root;
    }

    public class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;
        TreeNode(int x) { val = x; }
    }

}

辅助栈

K神解法：自上而下交换节点

class Solution {
    public TreeNode mirrorTree(TreeNode root) {
        if(root == null) return null;
        Stack<TreeNode> stack = new Stack<>() {{ add(root); }};
        while(!stack.isEmpty()) {
            TreeNode node = stack.pop();
            if(node.left != null) stack.add(node.left);
            if(node.right != null) stack.add(node.right);
            TreeNode tmp = node.left;
            node.left = node.right;
            node.right = tmp;
        }
        return root;
    }
}