hashtable

/**
 * Returns true if word is in dictionary else false.
 */
bool check(const char *word)
{
    //check hash index of current word
    int hash_index = hash(word);
    return check_single_index(head[hash_index], word);
}


bool check_single_index(hash_table *table, const char *word)
{
    hash_table *trav = table;
    // copy const char to new variable (to lowercase it)
    char *low_case_word = malloc((strlen(word) + 1) * sizeof(char));
    strcpy(low_case_word, word);

    // convert word to lowercase
    for(int i = 0; strlen(&word[i]); i++)
    {
        low_case_word[i] = tolower(word[i]);
    }

    // if first word in dictionary is word - return true
    if(strcmp(trav->word, low_case_word) == 0)
    {
        free(low_case_word);
        return true;
    }
    // if word is not first in dictionary - go further
    while(trav->next != NULL)
    {
        // go to next node
        trav = trav->next;

        // if current node includes word - return true
        if(strcmp(trav->word, low_case_word) == 0)
        {
            free(low_case_word);
            return true;
        }
    }

    free(low_case_word);
    return false;
}