We're in development. Going live soon.

Using a Queue for Traversal - Level-Order Traversal — BFS on Trees | OneNoughtOne

Loading content...

Data Structures & Algorithms0/361 completed

1.What is Level-Order Traversal 2.Using a Queue for Traversal 3.Processing Nodes Level by Level 4.Applications: Shortest Path in Unweighted Trees

Layer-by-Layer Binary Tree Values
Layer-by-Layer Binary Tree Values
Aggregate Path Numbers in Binary Tree
Rightmost Level Nodes

Course overview & roadmap

101OneNoughtOne

0/361

Using a Queue for Traversal

Sign in with a free account to read every lesson and save your progress.

Read the first lesson sample