Computer Science 261

Assignment # 11

Due:

• Part 1 will be due Monday, Dec. 3
• Part 2 will be due Wednesday, Dec. 5
• The informal exercise at the end will not be collected, but should be done before Friday's exam.

Purpose:

• To gain some experience in using binary search trees
• To consider how to implement the queue data structure in linked lists

Part 1:  Modify the program BinarySearchTree.java in the handouts folder to add code for the delete function.  Your code should work with the main() program as is.  Please do not change the main() program.

Part 2:  One final conversion of the inventory object:  Please implement a TreeInventoryObject for PartObject which will work with PartObject and the usual driver program, which will be called TreeInventoryDriver.  TreeInventoryDriver will look like LinkedInventoryDriver except that the newer driver program will use a TreeInventoryObject for the inventory (i.e., one line change in the program, probably).

Part 3:  (Part 3 is not to be handed in):  Consider how you might implement a queue of objects as a single linked list with pointers Front and Back pointing respectivly to the front and the back object in the queue.  This may be an exam question.

Any questions?  Please ask!

                        -Bob

.