In Java, write a recursive and an interative function that accepts as its parameter a pointer to a linked list and prints the contents of every element in the list. In another section, write a recursive function that accepts as a parameter a pointer to the root node of a tree and traverses the tree in pre-order. How would you change it to give in-order or post-order? Lastly, write a recursive function to count the number of nodes in the binary tree having exactly one child.