help!!!

CSCI 2315 Tree Exercise (Homework7) This is a 50-point exercise that will be turned in at the beginning of class Thursday, 16 November 2017. Please attach (staple) additional pages as necessary. All work should be neat, readable, and professionally done. Student 1. For the Tree shown below; determine: a. b. C. d. Which Node is Root Which Nodes are Leaves The Tree's depth The result of: Pre-order, postorder inorder traversals 2. For Each Node in the tree shown below: (create a table depicting each node for each requirement; nodes columns, requirements a. Name the Parent node b. List the Children c. List the Siblings d. Compute the height e. Compute the Depth f. Compute the Size 3. Please use the stack notation used in class and the given tree to show the stack states for all three: a. postorder traversal b. inorder traversal c. preorder traversal 4. What is the output of the mysteryPrint method for the following tree? (Show the stack) public static AnyType void nysteryPrist( BinaryodenyType t Systen.out.print t.getElenent ) Systes.out.pri t1n( t.getEleeent( ) ) System.out.printle( t.getElene )