#102 Binary Tree Level Order Traversal

最新推荐文章于 2024-02-12 01:19:39 发布

yoyooyooo

最新推荐文章于 2024-02-12 01:19:39 发布

阅读量127

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/YY_Tina/article/details/124055847

版权

java bfs

leetcode 专栏收录该内容

188 篇文章 0 订阅

订阅专栏

Description

Given the root of a binary tree, return the level order traversal of its nodes’ values. (i.e., from left to right, level by level).

Examples

Example 1:
在这里插入图片描述

Input: root = [3,9,20,null,null,15,7]
Output: [[3],[9,20],[15,7]]

Example 2:

Input: root = [1]
Output: [[1]]

Example 3:

Input: root = []
Output: []

Constraints:

The number of nodes in the tree is in the range [0, 2000].
-1000 <= Node.val <= 1000

思路

bfs，没什么好说的

代码

/**
 * 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>> answer = new ArrayList<>();
        
        List<TreeNode> currLayer = new ArrayList<>();
        currLayer.add(root);
        
        while (true) {
            List<TreeNode> nextLayer = new ArrayList<>();
            List<Integer> currLayerValue = new ArrayList<>();
            for (TreeNode node: currLayer) {
                if (node == null)
                    continue;
                nextLayer.add(node.left);
                nextLayer.add(node.right);
                currLayerValue.add(node.val);
            }
            
            if (nextLayer.size() == 0)
                break;
            answer.add(currLayerValue);
            currLayer = nextLayer;
        }
        
        return answer;
    }
}