class HashT
{
public:
    HashT();
    virtual ~HashT();
    Data* GetItem(string name);
private:

    struct node
    {
        Data item;
        node* next;
        node(const Data aData) : item(aData), next(NULL)
        {

        }

        ~node()
        {
           //Do I need to perform some sort of delete here?
        }
    };
    node** table;
    int size;
    Data data;
    const static int CAPACITY = 3;
};


HashT::~HashT()
{
    for (int i = 0; i < capacity; ++i)
    {
        while (table[i])
        {
            node *erase= table[i];
            table[i] = erase->next;
            delete erase;
        }
    }
    delete[] table;
}