Given a directory, print all files and folders present in directory tree rooted with given directory. We can iteratively traverse directory in BFS using below steps. We create an empty queue and we first enqueue given directory path. We run a loop while queue is not empty. We dequeue an item from queue. If the popped item is a directory, get list of all files and directories present in it, add each directory to the queue. If the popped item is a file, we print its name.
Java
import java.io.File;
import java.util.LinkedList;
import java.util.Queue;
class FileUtils {
public static void printDirsFiles(String inputDir)
{
Queue<File> queue = new LinkedList<>();
queue.add(new File(inputDir));
while (!queue.isEmpty()) {
File current = queue.poll();
File[] fileDirList = current.listFiles();
if (fileDirList != null) {
for (File fd : fileDirList) {
if (fd.isDirectory())
queue.add(fd);
else
System.out.println(fd);
}
}
}
}
public static void main(String[] args)
{
String inputDir = "C:\\Programs";
printDirsFiles(inputDir);
}
}
|
Time Complexity: O(n), where n is the number of files and folders present in directory tree rooted with given directory
Auxiliary Space: O(n)
If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape,
GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out -
check it out now!