Leetcode-二叉树-226. 翻转二叉树

题目：

翻转一棵二叉树。

示例：

输入：

     4
   /   \
  2     7
 / \   / \
1   3 6   9
输出：

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

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/invert-binary-tree

题解：

递归就行

代码：

从下至上

/**
 * 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 null;}
    TreeNode left   = invertTree(root.left);
    TreeNode right  = invertTree(root.right);
    root.right = left;
    root.left = right;
    return root;
    }
}

从上至下 

/**
 * 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 null;}
    TreeNode tmp = root.right;
    root.right = root.left;
    root.left = tmp;
    invertTree(root.left);
    invertTree(root.right);
    return root;
    }
}

 BFS

/**
 * 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 null;}
    Queue<TreeNode> queue = new LinkedList<>();
    queue.add(root);
    while(!queue.isEmpty())
    {
        TreeNode node=queue.poll();
        TreeNode tmp = node.left;
        node.left = node.right;
        node.right = tmp;
        if(node.left!=null){queue.add(node.left);}
        if(node.right!=null){queue.add(node.right);}
        
    }
    return root;
    }
}

DFS 

/**
 * 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 null;}
    Stack<TreeNode> stack = new Stack<>();
    stack.push(root);
    while(!stack.isEmpty())
    {
        TreeNode node=stack.pop();
        TreeNode tmp = node.left;
        node.left = node.right;
        node.right = tmp;
        if(node.left!=null){stack.push(node.left);}
        if(node.right!=null){stack.push(node.right);}
    }
    return root;
    }
}