ECE 231 Intermediate Programming
Fall 2008
Programming Assignment 6
Binary Search Trees, Template and Recursion
Due 12/04/2008, Thursday
Purpose
This assignment will give you practice with binary search trees, template and recursion.
Reading
The material on binary search trees is covered in Chapter 12. Templates are covered in
Chapter 9. Before you start working on this assignment, you are required to understand
the codes in Figure 12.7, which shows the contents of the BST class template. Figure 12.8
shows a driver program to test BST.
Programming Assignment
This assignment requires you to add some additional operations in the BST class template
and modify the test driver function to test each additional function you added. You are
required to add these in BST class template:
1. destructor
2. copy constructor
3. assignment operator
4. A recursive function member nodeCount() to count the nodes in a BST.
5. A recursive function member level()that determines the level in the BST at
which a specified item is located. (The root of the BST is at level 0, its children
are at level 1, and so on)
6. A recursive function member height()to determine the height of the BST.
Height is the number of the levels in the tree.
To help you to start working on this assignment, I will upload two files, which are in
Figure 12.7 and 12.8. They are BST.h and treetester.cpp. I also provide the
declarations of all the additional functions in BST.h file. You are required to provide
implementation of them. And you also need to modify treetester.cpp file to test
each additional function you added in BST class template.
