Data Structures · Trees and Heaps in Python: Traversals and heapq in Practice
Question 1 of 5
You must print a folder tree one level at a time: every top folder, then all their children, and so on. What drives that traversal?
Tip: press 1-4 to answer, Enter to continue. Finish the quiz to bank your XP.