HomeBreadth-First Search
Breadth-First Search
Level by level with a queue — the shortest unweighted path.
10 shown
- IntroductionLevel by level with a FIFO queueanimatedEasy
- Binary Tree Level OrderProcess one whole level per iterationanimatedMedium
- Rotting OrangesMulti-source BFS · rot spreads one ring per minuteanimatedMedium
- Practice problems
- Level Order SumProcess one whole level per queue passanimatedMedium
- Rightmost NodeLast node of every levelanimatedMedium
- Zigzag Level OrderLevel order, reversing every other rowanimatedMedium
- Maximum Width of Binary TreeIndex nodes as if the tree were an arrayanimatedMedium
- Minimum Knight MovesBFS over an unweighted move graphanimatedMedium
- 01 MatrixMulti-source BFS from every zero at onceanimatedMedium
- Bus RoutesBFS over routes, not stopsMedium