can you answer part e only ; thanks

Consider the following tree data structure: a. Use the skeleton C/CH code discussed Moor USA HOME WW Dries Na Dreptos Gracia b. Write the code for visiting the Tree nodes using a preorder traversal algorithm. c. Can you update the preorder traversal function in part b to print the depth of each node visited? d. Write the code for visiting the tree nodes using a post order traversal algorithm. e. Assume that the tree represents a directory system. Add to the structure representing the tree node an integer member representing the number of files in each tree node. Update the tree implementation by reinitializing the tree nodes with a particular number of files as presented in the figure below: Root USR 18 HOME BIN 15 Esans www 7 Projects 15 Graders Man Drives Does 18 Dropbox OneDrive