Looking specifically for problems # 5,7,8,9,11

- feel free to do the other problems as well, not required.

public class BinarySearchTree , V> L) that adds to the ArrayList L, the key value of leaf nodes. 11. Define a recursive method getDecreasingOrderList() that returns an ArrayList with the data elements of the tree inserted into the list based on decreasing key order. 12. Define a recursive method getDataOneChildNodes(ArrayList L) that adds to the ArrayList argument the data of nodes in the tree that have only one child. Add the elements to the ArrayList in any order. You must use an auxiliary function. 13. Define a recursive method that places the keys and values of a Tree into a Java TreeMap