Assignment 4 : Due Tuesday, August 8th

General Rules:

1. Program must be written in C++.
2. Must hand in source code, and "script" of program runs.
3. Grades discounted 10% per day late.

Project Description:


     You are to write a C++ program to implement binary
     search trees (BST). Find out more about BST in section 4.3.

     However, you must implement your trees using arrays as
     the storage medium (no poiners allowed).

     The items in the BST are integers. Your implementation should
     allow the handling of equal items by adding a count field to
     the node structure. Your program should implement the
     following operations:
          a. Create a BST with items input from a file
          b. Destroy a BST
          c. Search the BST for a given item
          d. Insert a item. If a plural item you just add one to
               its count
          e. Inorder traversal of the tree
               displaying the items and their counts as they
               are visited

     All these operations should be available to the user from a
     menu (the user should be able to specify the filename at runtime). 
     The user should have the option to continue or quit.