leetcode--Invert Binary Tree

题目：Invert Binary Tree

Invert a binary tree.

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

to

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

分析：递归的方法

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

Two:

public class Solution {
    public TreeNode invertTree(TreeNode root) {
        if (root==null) return root;
        final Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        while(!queue.isEmpty()){
            final TreeNode node = queue.poll();
            final TreeNode left = node.left;
            
            node.left = node.right;
            node.right = left;
            
            if(node.left!=null){
                queue.offer(node.left);
            }
            if(node.right!=null){
                queue.offer(node.right);
            }
        }
        return root;
    }
}

Three: Deque双端队列

public class Solution {
    public TreeNode invertTree(TreeNode root) {
        
        if (root == null) {
            return null;
        }

        final Deque<TreeNode> stack = new LinkedList<>();
        stack.push(root);
        
        while(!stack.isEmpty()) {
            final TreeNode node = stack.pop();
            final TreeNode left = node.left;
            node.left = node.right;
            node.right = left;
            
            if(node.left != null) {
                stack.push(node.left);
            }
            if(node.right != null) {
                stack.push(node.right);
            }
        }
        return root;
    }
}