Create a Binary Search Tree with generic types in JAVA

Use the [login to view URL] file to create a Binary Search Tree with generic types. Notice there is a separate key & value. In many examples the key IS the value. But this isn’t always the case. When complete, your BST should have: 1. toString in Node to return the node’s key. 2. toString in BST that handles pre-order, in-order, and postorder via the enumeration at the top. 3. Make all traversals recursive. 4. Do not change the skeleton, only add concrete implementation. This may be subject to change.