C programming to list directories and sub-directories

timer Asked: Jan 19th, 2014

Question description

In this project, you will write a system program called dirtree, which takes a directory name (absolute

path) as a command line argument and prints level, order, and name (absolute path) of all the

files and sub-directories residing in the given directory level by level.

Your program should traverse the disk structure starting from the given directory and build a tree

data structure. The root of the tree will be the given directory and its children will be the files and

sub-directories residing in the given directory. If a child node is a file, then it will be a leaf node; if

a child node is a sub-directory, then it can have zero or more children. Since a node in the tree may

have any number of children, children of a node should be represented as a linked-list.You can build

the tree in a recursive manner.

After building the tree, it should be printed out level by level. First the root node (level one), then

the nodes in level two, then the nodes in level three and so on. In order to print the tree level by level,

you will need to use a queue data structure.

Here is the sample of output:








Tutor Answer

(Top Tutor) Studypool Tutor
School: Cornell University
Studypool has helped 1,244,100 students
flag Report DMCA
Similar Questions
Hot Questions
Related Tags

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors