Given a binary tree root, return the level order traversal of it as a nested list, where each sublist contains the values of nodes at a particular level in the tree, from left to right.
Example 1:
Input: root = [1,2,3,4,5,6,7]
Output: [[1],[2,3],[4,5,6,7]]
Example 2:
Input: root = [1]
Output: [[1]]
Example 3:
Input: root = []
Output: []
Constraints:
0 <= The number of nodes in the tree <= 2000.-1000 <= Node.val <= 1000
Examples
Example 1:
Input: root = [1,2,3,4,5,6,7]
Output: [[1],[2,3],[4,5,6,7]]
Example 2:
Input: root = [1]
Output: [[1]]
Example 3:
Input: root = []
Output: []
Constraints
- `0 <= The number of nodes in the tree <= 2000`.
- `-1000 <= Node.val <= 1000`
Prerequisites
- Breadth-First Search(Data Structures & Algorithms for Beginners)
Target: O(N) time • O(1) spaceTree / Breadth-First Search / Binary Tree
Socratic AI Tutor
Gemini 3.8 Flash
Loading editor...
Click "Run" or press Ctrl+Enter to execute test cases.