226. Invert Binary Tree

Invert a binary tree.

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

to

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

Solution 1 Recusive

1ms 20.55%

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

Solution2 Use queue nonrecursive way

1ms 0.57%

public class Solution {
    public TreeNode invertTree(TreeNode root) {
      if(root == null)  
       {  
           return null;  
       }  
       Queue<TreeNode> queue = new LinkedList<TreeNode>();   
       queue.offer(root);  
       while(!queue.isEmpty())  
       {   
           TreeNode node = queue.poll();  
           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;     
    }
}