resumos/cursos/cs50/all-challenges/problems/speller/speller.c
bool unload(void)
{
    for (int count = 0; count < N; count++)
    {
        node *cursor = table[count];

        while (cursor)
        {
            node *temp = cursor;
            cursor = cursor->next;
            free(temp);
        }

        if (count == N - 1 && cursor == NULL)
        {
            return true;
        }
    }


    return false;
}
// Unloads dictionary from memory, returning true if successful, else false

Unloads dictionary from memory, returning true if successful, else false
Unloads dictionary from memory returning true if successful else false
bool unload(void)
{
    for (int count = 0; count < N; count++)
    {
        node *cursor = table[count];
        while (cursor)
        {
            node *temp = cursor;
            cursor = cursor->next;
            free(temp);
        }
        if (count == N - 1 && cursor == NULL)
        {
            return true;
        }
    }
    return false;
}
bool unload ( void ) { for ( int count = 0 ; count < N ; count ++ ) { node * cursor = table [ count ] ; while ( cursor ) { node * temp = cursor ; cursor = cursor -> next ; free ( temp ) ; } if ( count == N - 1 && cursor == NULL ) { return true ; } } return false ; }
Unloads dictionary from memory, returning true if successful, else false
Unloads dictionary from memory returning true if successful else false