BinarySearchTree — Your own implementation of a binary search tree
CSSE 221 – Fundamentals of Software Development Honors
Fall 2008–2009

This is an individual exercise. However, don't hesitate to ask questions of your instructor, student assistants and classmates as desired.

Goals

The goals of this exercise are to apply and hence reinforce your understanding of the use of:

• What a binary search tree is
• How a binary search tree is/contains a recursive data structure
• How to implement operations on a binary search tree, especially recursively

Instructions

1. Checkout your BinarySearchTree project from your individual respository. It has two classes:
   • Main -- use this for your informal testing.
   • BinarySearchTree -- it has stubs that you will implement (see next step).
2. Implement and test the 3 stubbed methods:
   • add
   • find
   • toString
3. When you are done, commit your BinarySearchTree project to turn it in.
   • Make sure that it obeys our code conventions -- use Source ~ Format if needed.