Implement the Table template class from Chapter 12, using a chained hash table to store the items.
Node* find_node(int key); // Precondition: none. // Postcondition: If there is a node in the Table with the specified // key, then the return value is a pointer to this node. Otherwise the // return value is NULL.
When you're satisfied with the implementation, submit your work via the CATE form for Project K.
2005/04/23