Hash header

binary tree node header

linked list node header

Using the headers above(if able too, you can modify it but try to maintain a similar format) Design a hash table data structure using chaining strategy. Your hash table should use chaining strategy and it should convert the linked list to a tree if the size of linked list become 11 or more and it should convert it back to a linked list if its size is smaller or equal to 9. The other specification of your hash table is the capability to change the size of the table dynamically. You have to have a rehash function that changes the size of the hash table if the number of entries exceeds (n lg n) in which n is the size of table. However your rehash function should not copy the older table in a larger table; it should insert the elements of the older table one by one in the new table (Why?).

Use C++ language, and modify the table header as need and include an implementation file