Binary Search Tree and Hash Table Program Assignment

This assignment involves writing two versions of the Marine Biology case study, then analyzing which version is more efficient.

Analyzing the two data structures and their algorithms is going to take time and effort. Your paper should reflect the time and effort you put into the research. Your grade will be based on this effort on the paper, not from just writing the code.

Separately implement the following two data structures:

Then use the following directions to analyze the two structures.

What to turn in

Briefly explaining how you implemented the BST and Hash class, and what was modified in other classes to use the BST and Hash classes.
Code for any header or implementation file altered or created. Altered files should have comments indicating code changes. Use a highlight marker and highlight all your changes/additions.
From the Analysis Assignment C go into detail about:
- How many times, on average, are the functions isEmpty, Update and AllFish called for one Step for the Simulation for both the BST & HT implementation.
- The Big-O for one step in the simulation for both the BST & HT implementation.
- How do their orders compare.
- What implementation do you think will be faster in practice.
Graph Time vs. Population for a fixed population (1000 steps on a 100x100 matrix, with 0-10,000 fish).
Graph Time vs. Average Population for a dynamic population (1000 steps on a 100x100 matrix, with 0-10,000 fish).
What are your conculsions; which is better.