CareerCup

public static void listStructure(String path) {
		listStructure(new File(path));
	}

	public static void listStructure(File file) {
		if (file.isDirectory()) {
			for (File f : file.listFiles()) {
				if (f.isDirectory())
					System.out.println(f.getAbsolutePath());
				listStructure(f);
			}
		}
		if (file.isFile()) {
			System.out.println(file.getAbsolutePath());
		}
	}

Can it be as simple as iterating a tree using BFS ?
Consider Node is a folder

Node temp = root;
Queue queue = new Queue();
queue.add(temp);

while (!queue.isEmpty()) {
	temp = queue.get();
	if (temp != null) {
		System.out.println(temp.name)
 		Node[] childrens = queue.getChildrens();
		while (Node child : childrens) {
			queue.add(child);
		}
	}
}

In Perl, on unix it is simple to list out the home directory and it's recursive directories and file using the "ls -ltR" command.

Run the command using `` operator (backtic)
++++++++++++
#!/usr/bin/perl

#!/usr/bin/perl

my @array = `ls -ltR /home`;

print " Dir structure \n @array \n";

+++++++++++++++++++

In Perl on windows to list out sub directories, Use "tree" command

my @array = `tree D:/Songs`;

print " Directory \n @array \n";

In Perl on Windows to list out directories use "tree"

my @array = `tree D:/Songs`;

print "Directory \n @array \n";