Level Order of Binary Tree

Queue-based BFS visualizer for level-by-level traversal

Read Here
Step0/30
Levels0
Max Level Size0
Back To Trees List

Python Code

7 while queue:
level_size = len(queue)
9 level = []
......
11 node, _ = queue.popleft()
12 level.append(node.val)
13 if node.left:
14 queue.append((node.left, 0))
15 if node.right:
16 queue.append((node.right, 0))
17 ans.append(level)
18 return ans
Current Line (8): Start Level Loop

Tree Structure

123456
Operation:Start level 0 with 1 node(s) in queue

Traversal Progress

Current Node

-

Current Width

0

Level

-

Max Level Size

0

Level Order Result

Level arrays appear here...
Phase: Start Level
Step 1: Start level 0 with 1 node(s) in queue

Processing Stack

Stack is empty. Click Next to begin!

Step Explanation

Ready to Start

Click "Next Step" to begin level-order traversal. BFS processes nodes level by level using a queue.

  • > For each level: dequeue level_size nodes, collect their values, and enqueue children.
Unvisited
Left
Current
Right
Done