Playground

Level Order Traversal

Practice level order traversal on a tree step-by-step while watching the queue, visits, and traversal result.

Level Order Traversal

Traverse a tree level by level using a queue, the same BFS idea, applied to a binary tree.

class TreeNode {
data: any;
left: TreeNode | null;
right: TreeNode | null;
}
Add
Parent
Delete
Memory Queue (FIFO)
Queue is empty
Traversal Output
Pending...
LLRRLR1ROOT245367
100%

LEVELORDER

If root is null: return []
queue = [root]
While queue is not empty:
node = queue.shift()
Visit node
If node.left: queue.push(left)
If node.right: queue.push(right)
Return traversal result

Console Output

NODES: 7
>Waiting for traversal...