gistfile1.hpp

//   File: p06.cpp
//   Name: Mark Sands
//   Date: 12/02/08
// Course: CS 240 - Introduction to Computing III
//   Desc: This program demonstrates a Binary Search Tree with the ability to index by
//		   a static key value in order to sort, display, and remove in a robust manner.
//
//         Other files required: IndexedBST.h, IndexedBST.cpp 
//------------------------------------------------------------------------------------------

#include <iostream>
#include <iomanip>
#include <string>
#include "BST.h"
#include "SearchableADT.h"

void ShowStats( SearchableADT<string>*& dictionary );


int main( int argc, char* argv[] )
{

        SearchableADT<string>* dictionary = new BST<string>;

	ShowStats( SearchableADT<string>*& dictionary );
	
        return 0;
}

void ShowStats( SearchableADT<string>*& dictionary )
{
	cout << "Number of entries: "
		 << dictionary->numEntries() << endl;
}