I need help with D please. If you can, can you write the code in C++

a. create the following tree data structure: Root USR BIN HOME Exams HWS Projects Grades Drives Docs Main Dropbox OneDrive 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. a. create the following tree data structure: Root USR BIN HOME Exams HWS Projects Grades Drives Docs Main Dropbox OneDrive 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