代码随想录算法训练营第十五天| 102. 二叉树的层序遍历、 226.翻转二叉树、101.对称二叉树

文档讲解：102. 二叉树的层序遍历、 226.翻转二叉树、101.对称二叉树

题目链接：102. 二叉树的层序遍历、 226.翻转二叉树、101.对称二叉树

思路：

1、二叉树的层序遍历是通过队列来实现的，每一层都需要node先进，下一层时再出，并且将该层的孩子节点放入队列。相当于图的BFS

2、翻转二叉树主要是对二叉树进行反转，将每一个节点的孩子节点都进行一次翻转以后，就完成了题目要求，所以要确定是用前中后序遍历或者层序遍历的哪一种进行遍历翻转。我使用的是前序遍历进行翻转。

3、对称二叉树的思想主要是对每个节点的左右两节点进行对比，若不等返回false，遍历整个二叉树，若有一个false，则都返回false，本题使用的是递归方法进行遍历。

102. 二叉树的层序遍历

/**
 * 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 List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> res = new ArrayList<>();
        if(root == null){
            return res;
        }
        Deque<TreeNode> deque = new LinkedList<>();
        deque.add(root);
        while(!deque.isEmpty()){
            int size = deque.size();
            List<Integer> list = new ArrayList<>();
            while(size>0){
                TreeNode node1 = deque.poll();
                list.add(node1.val);
                if(node1.left != null) deque.add(node1.left);
                if(node1.right != null) deque.add(node1.right);
                size--;
            }
            res.add(list);
        }
        return res;
    }
}

226.翻转二叉树

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

101.对称二叉树

/**
 * 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 boolean isSymmetric(TreeNode root) {
        if(root == null){
            return true;
        }
        return dfs(root.left, root.right);
    }
    public boolean dfs(TreeNode left, TreeNode right){
        if(left == null && right == null){
            return true;
        }
        if(left == null || right == null || left.val != right.val){
            return false;
        }
        return dfs(left.left, right.right) && dfs(left.right, right.left);
    }
}