剑指Offer——二叉树的镜像

题目描述

操作给定的二叉树，将其变换为源二叉树的镜像。
二叉树的镜像定义：源二叉树
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;

    }

}

解题思路

通过遍历，把每个节点的左右子树交换即可

1. 递归的方式

public class Solution {
    public void Mirror(TreeNode root) {
        if(root == null)return;

        TreeNode left = root.left;
        TreeNode right = root.right;
        root.left = right;
        root.right = left;

        Mirror(left);
        Mirror(right);

    }
}

1. 非递归，使用先序遍历

import java.util.Stack;
public class Solution {
    public void Mirror(TreeNode root) {
        if(root == null)return;

        Stack<TreeNode> stack = new Stack<TreeNode>();
        stack.push(root);
        while(!stack.isEmpty()){
            TreeNode node = stack.pop();

            TreeNode left = node.left;
            TreeNode right = node.right;
            if(left!=null || right!=null){
                node.left = right;
                node.right = left;
            }

            if(right != null)stack.push(right);
            if(left != null)stack.push(left);
        }

    }
}