leetcode 226. 翻转二叉树

难度：简单
频次：47

题目：

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

解题思路：

• 1.DFS遍历的时候反转root的左右节点即可
• 2.后者用队列模拟栈模拟递归

代码

/**
 * 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) {
        DFS(root);
        return  root;
    }
    public void DFS(TreeNode root){
        if(root==null) return;
        TreeNode temp=root.left;
        root.left=root.right;
        root.right=temp;
        DFS(root.left);
        DFS(root.right);
    }
}

代码

/**
 * 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;
        Deque<TreeNode> queue=new LinkedList<TreeNode>();
        queue.add(root);
        while(!queue.isEmpty()){
            //拿出一个节点
            TreeNode node=queue.poll();
            //交换左右节点
            TreeNode temp=node.left;
            node.left=node.right;
            node.right=temp;
            //判断必须有，不然add空姐点，然后poll空姐点，死循环
            if(node.left!=null) queue.add(node.left);
            if(node.right!=null)  queue.add(node.right);
        }
        return root;
    }

}