二叉树层序遍历题目

102. 二叉树的层序遍历

领扣地址：https://leetcode-cn.com/problems/binary-tree-level-order-traversal/

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

        if (root == null){
            return res;
        }

        //将根结点加入队列
        queue.offer(root);

        while (!queue.isEmpty()){
            //用来存储当前层的结点
            List<Integer> cur = new ArrayList<>();
            int size = queue.size();

            //扩展当前队列中的所有结点
            for (int i = 0; i < size; i++) {
                TreeNode node = queue.poll();
                cur.add(node.val);

                if (node.left != null){
                    queue.add(node.left);
                }

                if (node.right != null){
                    queue.add(node.right);
                }

            }

            res.add(cur);

        }
        return res;
    }
}

111. 二叉树的最小深度

领扣地址：https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/

class Solution {
    public int minDepth(TreeNode root) {
        if(root == null) {
            return 0;
        }

        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);

        //root本身算一层
        int depth = 1;

        //扩展结点
        while (!queue.isEmpty()) {
            int size = queue.size();
            for (int i = 0; i < size; i++) {
                TreeNode cur = queue.poll();

                //叶子结点判断
                if (cur.left == null && cur.right == null){
                    return depth;
                }

                if (cur.left != null){
                    queue.offer(cur.left);
                }

                if (cur.right != null){
                    queue.offer(cur.right);
                }
            }
            depth++;
        }

        return depth;
    }
}