In lectures, we have discussed the benefits of using binary search trees and hash tables to store information. In this assignment, you will implement both and compare their performances in terms of speed of access.
You are required to create a binary search tree and hash table data structures to store strings. Both structures should have functions to add and remove elements. The classes MUST be implemented as class templates. The binary search tree class must be called BSTree and will use as nodes instances of BTNode. The hash table class must be named HTable.
You will be provided a demo file and your classes need to interface with it. The binary search tree contents must be printed using an inorder traversal.
The hash table class must store the items in an array of size 150, and the contents can be printed from position 0 to n-1, but only for those positions that contain a valid entry. The hash function used must sum up the ASCII values of each character in the string and return the result of that sum mod (%) 150:
int hashfunc(string value)
int addResult = 0;
// put you code here to add up the ASCII codes
// of all characters in value and store in the
// integer variable addResult
return addResult % 150;
DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma
Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t
Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th
1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of
1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of