The programming task requires you to create a utility to traverse a specified directory in breadth-first order. Breadth-first search
explores all the nodes at a given level before descending lower in the tree. Breadth-first search is implemented with a queue.
As the program encounters each directory node at a particular level, it enqueues the pathname for later examination. You can
use the following pseudocode which makes use of queue ADT. You will have to provide the code for queue ADT operations
i want a make file for the project
Copyright © 2020 | Truelancer.com