You are required to create a binary search tree and a hash table data structures to store strings that will function with the demo.cpp file supplied
Both structures should have functions to add, search and remove elements, and MUST be 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 numbers in an array of integers with 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 be:

Place New Order
It's Free, Fast & Safe

"Looking for a Similar Assignment? Order now and Get a Discount!