CS 2500 Programming Assignment #5 Top Down Design and other items Due December 01, 1995 (See below.) Program and Test Script Due December 08, 1995 Extending the Binary Search Tree ADT The assignment is #2 in your text on pages A104-A105. Please read it. SPECIAL NOTES: The assignment in the book says to have the program write to an output file. Please do NOT do that. Make the program write only to the screen. You will find code for a binary search tree ADT in file tree.pas of the CourseDisks/DL_Stuff3 directory on Gopher. You should build your program by adding things to a copy of that file, because it contains declarations and many BST operations you will want to use. Students are to turn in: 1. The written specifications for the new operations. 2. A top down design for each new operation 3. A copy of the test plan for testing all the new operations. 4. A copy of a working test driver, containing the code for all the new operations. 5. A copy of a script, showing that you carried out all the tests in your test plan. Turn in 1-3 by e-mail before midnight Friday, December 01, 1995 Turn in 4-5 by e-mail before midnight Friday, December 08, 1995