Leetcode 102. Binary Tree Level Order Traversal

最新推荐文章于 2025-04-23 11:41:53 发布

parallelyk

最新推荐文章于 2025-04-23 11:41:53 发布

阅读量418

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode

本文链接：https://blog.csdn.net/parallelyk/article/details/51842470

Leetcode 专栏收录该内容

15 篇文章

订阅专栏

本文介绍了一种解决二叉树层次遍历问题的方法。通过使用队列来辅助实现从根节点开始，按层次顺序遍历每个节点并返回各层级节点的值。示例代码清晰展示了如何一步步完成这一过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

For example:
Given binary tree [3,9,20,null,null,15,7],

return its level order traversal as:

[
  [3],
  [9,20],
  [15,7]
]

Subscribe to see which companies asked this question

public class Solution {
    private Queue<TreeNode> q = new LinkedList<TreeNode>();
    List<List<Integer>> lists = new ArrayList<List<Integer>>();
    public List<List<Integer>> levelOrder(TreeNode root) {
        
        if(root!= null){
            core(root);
        }
        return lists;
    }
    private void core(TreeNode root){
        q.offer(root);
        int count = 1;
        int nextCount = 0;
        while(!q.isEmpty()){
            List<Integer> list = new ArrayList<Integer>();
            for(int i= 0 ;i<count;i++){
                TreeNode node = q.poll();
                list.add(node.val);
                if(node.left!=null){
                    q.offer(node.left);
                    nextCount++;
                }
                if(node.right!=null){
                    q.offer(node.right);
                    nextCount++;
                }
            }
            lists.add(list);
            count = nextCount;
            nextCount = 0;
        }
        
    }
}