Due (PreLab, bridge): Monday, 24 Apr 2000, end of class.

Due (In-Lab/PostLab): Monday, 24 Apr 2000, end of class.

Goals:

1. Understand binary search trees.

2. Use recursion.

3. Review pointers.

Note: we are using lab 12 from the Roberge book!

Requirements.

1. Complete prelab 12 and the bridge exercise from the Data Structures in C++ lab manual by Roberge. This lab demonstrates the use of binarty search trees.

2. You may work in pairs for the PreLab and bridge. Turn in your completed pages 245 - 246 in class on Monday. Place all the files that I need to run your solution into a folder labeled with your last name(s) and drag it into the appropriate prelab folder in the Turn-In folder on Nova. If I cannot open your folder, double click on your project file, and run your solution (or at least look at it in C++ builder if you haven't completed it), you will not get credit for handing it in.

3. You must next complete in-lab exercise 1 from the lab book. This part must be done individually.

4. Finally, complete postlab exercises 1 and 2. This must be done individually.

   Turn in pages 247-250 and 255-257 in class Monday. Place all of the files that I need to run your in-lab solution into a folder labeled with your last name and drag it into the appropriate lab folder in the Turn-In folder on Nova.

Late prelabs, bridges, and postlabs will be penalized as described in the study guide.

All results must be put into the appropriate lab folder on the cs174jb nova account.

All prelabs must have a heading identifying the people who worked on the project. Programs must also contain appropriate comments and headings. Make sure that your code is commented and formatted appropriately. See the style sheets.

Additional requirements:

1. The functions insert, retrieve, and remove must be recursive.

2. Your test plan need cover only characters. Every test plan given in the in-labs must be filled out appropriately. Part of your grade will be based on the completeness of your test plan.

3. You must include pre and post conditions in every member function that you write (both preLab and Lab). These must be as specific as possible.

4. Your code must be commented and appropriately formatted. Code in any block (ie in any set of braces) must be indented at least 3 spaces.

5. Your member functions must check for any requirements (preconditions) that are part of the ADT structure. If the requirements are not met by the parameters, the member functions must provide a proper response.

6. Place only your last names on the folder that you turn in. Make sure that the prelab is placed in the prelab folder on Nova and the lab is placed in the lab folder on Nova.

7. Written answers must be legible. If I can't read an answer, I will mark it wrong. Print or type if you must.

Hints:

• Important Note!!! The List and ListNode classes reference each other (a List contains a ListNode and a ListNode names a List as a friend). A compiler will have problems with this circular reference. The correct way to get around this problem is to prototype the List class before the ListNode class is declared. Unfortunately, both classes are templated and Builder C++ does not allow forward references of templated classes. This is not a C++ problem, it's a Builder problem.

  For this lab, we will resolve this problem by making all of the data public. The result is:

  template 
  class ListNode
  {
  	public:
  		
  			// Constructor
  			ListNode ( const LE &elem, ListNode *nextPtr );
  			
  			// Data Members
  			LE element;			// List element
  			ListNode *next;	// Pointer to the next element
  			
  };
  

• Remember that you must allocate storage explicitly (by using new) before you can reference a value using a pointer variable.

• Remember that an insert operation will require the dynamic creation of a new ListNode element.

• Remember to delete an element if you remove it or when you run clear(). You will lose points for memory leaks!

Return to Student Pages

Return to John Barr's Home Page

Last Modified: 17 April 2000

THIS PAGE MAINTAINED BY:
John Barr, Ithaca College