【LeetCode】226. Invert Binary Tree

Question：

Invert a binary tree.

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

to

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

Solution：

My solution （No recursion）：1ms

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode invertTree(TreeNode root) {
        LinkedList<TreeNode> list = new LinkedList<TreeNode>();
        if(root == null){
            return null;
        }
        root = change(root);
        list.push(root);
        while(list.size() > 0){
            TreeNode node = list.pop();
            if(null != node.left){
                node.left = change(node.left);
                list.offer(node.left);
            }
            if(null != node.right){
                node.right = change(node.right);
                list.offer(node.right);
            }

        }
        return root;
    }
    public TreeNode change(TreeNode node){
        TreeNode temp = node.left;
        node.left = node.right;
        node.right = temp;
        return node;
    }
}

My solution 2 (recursion) : 0ms

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode invertTree(TreeNode root) {
        if(root == null){
            return null;
        }
        root = change(root);
        return root;
    }
    public TreeNode change(TreeNode node){
        TreeNode temp = node.left;
        node.left = node.right;
        if(node.left != null){
            node.left = change(node.left);
        }
        node.right = temp;
        if(node.right != null){
            node.right = change(node.right);
        }

        return node;
    }
}