127. Binary Tree Level Order Traversal

PRO

Medium

Topics

Companies

Helpful tools to learn & understand

Watch key transitions, pointers, and variables update step-by-step.

Open

Read clean, documented implementations across multiple patterns.

View Code

Sketch diagrams on an infinite canvas and draft notes directly inline.

Draw

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

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

Explanation: The tree has 3 levels: the root (3), the children of the root (9, 20), and the children of 9 and 20 (15, 7).

Input: root = [1]

Output: [[1]]

Explanation: The tree has only one node, the root (1).

Input: root = []

Output: []

Explanation: The tree is empty, so the result is an empty list.

Time Complexity

O(n)

Space Complexity

O(w)