[Leetcode从零开刷]226. Invert Binary Tree

题目来源：
leetcode
Invert a binary tree.

翻译：颠倒一个二叉树
解题：
如果不是根节点不用交换。
代码如下，

class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {

        if(!root) return root;
        else
        {
            swap(root->left,root->right);   //这个就是交换的的函数了。
        }

        invertTree(root->right);
        invertTree(root->left);
        return root;      
    }
};

另外一种思路,感觉厉害多了：

          if (!root)
            return root;

        TreeNode* tmp = root->left;
        root->left = invertTree(root->right);
        root->right = invertTree(tmp);     //直接交换交换过的结点就好了

        return root;

想对应的java，和c++的区别就是不是指针，就是一个结构体就好了。

/**
 * 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 root;

        TreeNode tmp = root.left;
        root.left = invertTree(root.right);
        root.right = invertTree(tmp);

        return root;

java
深度优先算法：

class Solution {
    public TreeNode invertTree(TreeNode root) {      
          if (root == null)
            return null;  
        Stack<TreeNode> stack = new Stack<>();
        stack.push(root);
        while(!stack.isEmpty()){
            TreeNode temp = stack.pop();
            TreeNode left = temp.left;
            temp.left = temp.right;
            temp.right = left;
            if(temp.left!=null)stack.push(temp.left);
            if(temp.right!=null)stack.push(temp.right);
        }
        return root;       
    }
}

广度优先算法：
java:

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