[LeetCode]226. 翻转二叉树

题目

翻转一棵二叉树。

示例：

输入：

     4
   /   \
  2     7
 / \   / \
1   3 6   9

输出：

     4
   /   \
  7     2
 / \   / \
9   6 3   1

解题思路

详细思路请参考 面试题27. 二叉树的镜像

代码

解法一：递归法：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */

class Solution {
    public TreeNode invertTree(TreeNode root) {
        if(root == null){
            return null;
        }
        TreeNode temp = root.left;
        root.left = root.right;
        root.right = temp;
        if(root.left != null){
            invertTree(root.left);
        }
        if(root.right != null){
            invertTree(root.right);
        }
        return root;
    }
}

解法二：辅助栈

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */

class Solution {
    public TreeNode invertTree(TreeNode root) {
        if(root == null){
            return null;
        }
        Deque<TreeNode> stack = new ArrayDeque<TreeNode>();
        stack.addLast(root);
        while(!stack.isEmpty()){
            TreeNode node = stack.removeLast();
            TreeNode temp = node.left;
            node.left = node.right;
            node.right = temp;
            if(node.left != null){
                stack.addLast(node.left);
            }
            if(node.right != null){
                stack.addLast(node.right);
            }
            // 写在上处也可以
            // TreeNode temp = node.left;
            // node.left = node.right;
            // node.right = temp;
        }
        return root;
    }
}