CSCI 146: Lab 12 Materials

The main goal of Lab 12 (to be held on November 24 and 25, 1997) is to understand the pointer implementation of binary search trees. Students will complete the implementation of a bag class that uses a binary search tree to store the bag elements.

The following activities will be carried out in the lab:

• Download the binary tree toolkit (version 2) header file, bintree2.h and template implementation file, bintree2.tem.
• Review these files and the differences with respect to the code in the textbook.
• Download the String ADT header (mystring.h) and implementation (mystring.cxx) files.
• Download a simple test program (author.cxx) .
• Download the header (bag6.h) and template implementation (bag6.tem) files for the bag class using binary search trees.
• Complete the implementation of the bag class using binary search trees. Note that the class includes a function to print the binary search tree that contains the members of the bag.