reate a binary search tree and hash table data structures to store strings. Both structures should have functions to add and remove elements.C++ Programming

INTRODUCTION

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.

ASSIGNMENT TASK

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;

}

Attachments:

Instructions Files

C++ Programming Experts

expert
Eric Bell
C++ Programming

88 Answers

expert
Dinh Hong P.
C++ Programming

20 Answers

View More Experts
Disclaimer

The ready solutions purchased from Library are already used solutions. Please do not submit them directly as it may lead to plagiarism. Once paid, the solution file download link will be sent to your provided email. Please either use them for learning purpose or re-write them in your own language. In case if you haven't get the email, do let us know via chat support.

Get Free Quote!

257 Experts Online