package
Version:
v1.6.5
Opens a new window with list of versions in this module.
Published: Mar 23, 2021
License: MIT
Opens a new window with license information.
Imports: 0
Opens a new window with list of imports.
Imported by: 0
Opens a new window with list of known importers.
README
¶
< Previous
Next >
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
[Tree]
[Breadth-first Search]
Similar Questions
- Binary Tree Zigzag Level Order Traversal (Medium)
- Binary Tree Level Order Traversal II (Medium)
- Minimum Depth of Binary Tree (Easy)
- Binary Tree Vertical Order Traversal (Medium)
- Average of Levels in Binary Tree (Easy)
- N-ary Tree Level Order Traversal (Medium)
- Cousins in Binary Tree (Easy)
Documentation
¶
There is no documentation for this package.
Source Files
¶
Click to show internal directories.
Click to hide internal directories.