Node * copy(Node * n)
{
    if (n == nullptr)
    return nullptr;
    else {
    Node * p = new Node;
    p -> info = n -> info;
    p -> value = n -> value;
    p -> next = new Node(copy(n->next));
    }
}

void HashMap::add(string key1, string value1)
{
    int index=3;
    for (Node * p=database[index]; p != nullptr; p=p->next)
    {
    if (p->next == nullptr) {
        p->next=new Node;
        p->next->key = key1;
        p->next->value = value1;
        p->next->next = nullptr;
        break;
    }
    }
}