102. Binary Tree Level Order Traversal
Medium72.2% acceptance3,294,009 / 4,561,885 submissions
Asked by 14 companies
Topics
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).
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
Hints
Hint 1
Use a queue to perform BFS.
Similar Questions
Binary Tree Zigzag Level Order TraversalMediumBinary Tree Level Order Traversal IIMediumMinimum Depth of Binary TreeEasyBinary Tree Vertical Order TraversalMediumAverage of Levels in Binary TreeEasyN-ary Tree Level Order TraversalMediumCousins in Binary TreeEasyMinimum Number of Operations to Sort a Binary Tree by LevelMediumDivide Nodes Into the Maximum Number of GroupsHard