If you can, can you do it in Java

a. Use the skeleton C/C++ code discussed in class to create the following tree data structure: Root USR BIN HOME ms 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