代码随想录打卡day15|102. 二叉树的层序遍历226. 翻转二叉树101. 对称二叉树

代码随想录打卡day15|102. 二叉树的层序遍历226. 翻转二叉树101. 对称二叉树

102. 二叉树的层序遍历

DFS递归原理：

void dfs(TreeNode root) {
    if (root == null) {
        return;
    }
    dfs(root.left);
    dfs(root.right);
}

BFS原理：

void bfs(TreeNode root) {
    Queue<TreeNode> queue = new ArrayDeque<>();
    queue.add(root);
    while (!queue.isEmpty()) {
        TreeNode node = queue.poll();
        if (node.left != null) {
            queue.add(node.left);
        }
        if (node.right != null) {
            queue.add(node.right);
        }
    }
}

//迭代
class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> list = new ArrayList<>();
        Queue<TreeNode> queue = new LinkedList<>();

        if(root != null)queue.add(root);

        while(!queue.isEmpty()){
            int n = queue.size();
            List<Integer> level = new ArrayList<>();
            for(int i = 0 ; i < n ; i++){
                TreeNode node = queue.poll();
                level.add(node.val);
                if(node.left != null)queue.offer(node.left);
                if(node.right != null)queue.offer(node.right);
            }
            list.add(level);
        }
        return list;
    }

}
//递归
 */
class Solution {
    List<List<Integer>> list = new ArrayList<>();
    public List<List<Integer>> levelOrder(TreeNode root) {
        dfs(root,0);
        return list;
    }
    void dfs(TreeNode node , int deep){
        if(node == null)return;
        deep++;
        if(list.size() <deep){
            List<Integer> temp = new ArrayList<>();
            list.add(temp);
        }
        list.get(deep - 1).add(node.val);
        dfs(node.left,deep);
        dfs(node.right,deep);
    }
}

226. 翻转二叉树

//dfs
class Solution {
    public TreeNode invertTree(TreeNode root) {
        if(root == null)return root;
        swap(root);
        invertTree(root.left);
        invertTree(root.right);
        return root;
    }
    void swap(TreeNode root) {
        TreeNode temp = root.left;
        root.left = root.right;
        root.right = temp;
    }
}
//bfs
class Solution {
    public TreeNode invertTree(TreeNode root) {
        if(root == null)return null;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        while(!queue.isEmpty()){
            for(int i = 0 ; i < queue.size();i++){
                TreeNode node = queue.poll();
                swap(node);
            if(node.left != null)queue.offer(node.left);
            if(node.right != null)queue.offer(node.right);
            }
            
        }
        return root;
    }
    void swap(TreeNode root) {
        TreeNode temp = root.left;
        root.left = root.right;
        root.right = temp;
    }
}

101. 对称二叉树

class Solution {
   public boolean isSymmetric(TreeNode root) {
        return compare(root.left, root.right);
    }

    private boolean compare(TreeNode left, TreeNode right) {

        if (left == null && right != null) {
            return false;
        }
        if (left != null && right == null) {
            return false;
        }

        if (left == null && right == null) {
            return true;
        }
        if (left.val != right.val) {
            return false;
        }
        // 比较外侧
        boolean compareOutside = compare(left.left, right.right);
        // 比较内侧
        boolean compareInside = compare(left.right, right.left);
        return compareOutside && compareInside;
    }
}