LeetCode226.翻转二叉树——java

题目描述：

给你一棵二叉树的根节点 root ，翻转这棵二叉树，并返回其根节点。

示例 1：

输入：root = [4,2,7,1,3,6,9] 输出：[4,7,2,9,6,3,1]
示例 2：

输入：root = [2,1,3] 输出：[2,3,1]
示例 3：

输入：root = [] 输出：[]

解法一：递归法（DFS）：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode invertTree(TreeNode root) {
            invert(root);
            return root;
    }

    public TreeNode invert(TreeNode node)
    {
        if(node==null)
        {
            return node;
        }
        TreeNode temp=node.left;
        node.left=node.right;
        node.right=temp;
        invert(node.left);
        invert(node.right);
        return node;
    }

}

解法二：迭代法（BFS）

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode invertTree(TreeNode root) {
        if(root==null)
        {
            return null;
        }
          ArrayDeque<TreeNode> que = new ArrayDeque<>();
            que.offer(root);
            while(!que.isEmpty())
            {
                int size=que.size();
                for(int i=0;i<size;i++)
                {
                    TreeNode node=que.poll();
                      swap(node);
                    if(node.left!=null)
                    {
                        que.offer(node.left);
                    }
                    if(node.right!=null)
                    {
                        que.offer(node.right);
                    }
                }
            }
            return root;
    }
    public void swap(TreeNode node)
    {
        TreeNode temp=node.left;
        node.left=node.right;
        node.right=temp;
    }

   

}