Using breadth first search in binary trees
In this video, you learned how to implement the breadth first search (BFS) algorithm. As you saw, BFS explores the nodes of a binary tree level-by-level.
Given this binary tree, what order will the BFS algorithm follow?
This exercise is part of the course
Data Structures and Algorithms in Python
Hands-on interactive exercise
Turn theory into action with one of our interactive exercises
