List* check(string key) {
        Node *curr = this->head;
        List *q = new List();
        while(curr != nullptr) {
            if(curr->data == key) {
                q->add(curr->data);
            }
            curr = curr->pNext;
    }
    return q;

	string key;
    cin >> key;
    for(size_t i = 0; i < size_of_table; ++i) {
        if(table.arr[i].Size()) {
            List *newList = table.arr[i].check(key);
        }
    }