226. Invert Binary Tree（反转二叉树）

题目描述

方法思路

Approach1:

class Solution {
    //Runtime: 0 ms, faster than 100.00% 
    //Memory Usage: 35.8 MB, less than 9.58%
    public TreeNode invertTree(TreeNode root) {
        if(root == null) return root;
        if(root.left == null){
            root.left = invertTree(root.right);
            root.right = null;
        }
        else if(root.right == null){
            root.right = invertTree(root.left);
            root.left = null;
        }else{
            TreeNode temp = root.left;
            root.left = invertTree(root.right);
            root.right = invertTree(temp);
        }
        return root;
    }
}

简化版本：

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

Approach2:

class Solution {
    //Runtime: 0 ms, faster than 100.00% 
    //Memory Usage: 35.7 MB, less than 28.73%
    public TreeNode invertTree(TreeNode root) {
        if(root == null) return root;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.add(root);
        while(!queue.isEmpty()){
            TreeNode node = queue.poll();
            TreeNode temp = node.left;
            node.left = node.right;
            node.right = temp;
            if(node.left != null) queue.add(node.left);
            if(node.right != null) queue.add(node.right);
        }
        return root;
    }