lab32/lab2380_32.cpp // *****************************************************************
// Author: Zhixiang Chen
// Class: CSCI/CMPE 2380.01, Fall, 2008
// Lab 32: Binary search tree
// Date: October 29, 2008
// Comment: The code here is meant to be revised.
//
//—————————————————————–
// Lab Exercise 32:
//
// Description: This program is to implement the binary search tree
// class template
// *****************************************************************
#include
#include
#include
#include

#include “lab2380_32.h”

using namespace std;

int main()
{
/**********************************************************
Part: Some practice
**********************************************************/
//var decarations
unsigned int seed; //a random seed
int num; //to hold an int value
binarySearchTree tree; //create a list of int type
char tag;

cout “; //get the random seed
cin >> seed;
srand(seed); //set the randon seed

for (int i=0; i >tag;
switch (tag)
{
case ‘d’:
case ‘D’:
cout