Use the BSTSkeleton.java 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 isnt always the case. When complete, your BST should have:
toString in Node to return the nodes key.
toString in BST that handles pre-order, in-order, and postorder via the enumeration at the top.
Make all traversals recursive.
Do not change the skeleton, only add concrete implementation. This may be subject to change.
It is not our intention to break the school's academic policy. Posted solutions are meant to be used as a reference
and should not be submitted as is. We are not held liable for any misuse of the solutions.
Please see the frequently asked questions page
for further questions and inquiries.
Kindly complete the form.
Please provide a valid email address and we will get back to you within 24 hours.
Payment is through PayPal, Buy me a Coffee
or Cryptocurrency.
We are a nonprofit organization however we need funds to keep this organization operating
and to be able to complete our research and development projects.
