我不明白为什么会出现分段错误。我对哈希表的理解是，你为输入（在这种情况下是一个字符串）计算一个哈希值，并使用该值作为表的索引，允许你立即检查输入是否存在，而无需实际搜索它。下面是我的hash函数代码：

typedef struct node
{
    char word[LENGTH + 1];
}
node;
// set a size for the hash table
const unsigned int N = 100049;

// Hash table
node *table[N];

// Returns true if word is in dictionary, else false
bool check(const char *word)
{
    if (table[hash(word)] != NULL)
    {
        return true;
    }

    return false;
}

// Hashes word to a number
unsigned int hash(const char *word)
{

    unsigned int hash_value = 7;
    for (int i = 0; word[i] != '\0'; i++)
    {
       hash_value = word[i] * hash_value;
    }

    return hash_value % N;
}

// Loads dictionary into memory, returning true if successful, else false
bool load(const char *dictionary)
{
    for (int j = 0; j < N; j++)
    {
        table[j] = NULL;
    }
    FILE *infile = fopen(dictionary, "r");
    if (infile == NULL)
    {
        return false;
    }

    char *word = NULL;
    while (fscanf(infile, "%s", word) != EOF)
    {
        node *new_node = malloc(sizeof(node));
        if (new_node == NULL)
        {
            return false;
        }

        int hash_value = hash(word);
        table[hash_value] = new_node;
        strcpy(new_node->word, word);
        wordc ++;

    }

    fclose (infile);

    return true;
}

它编译得很好，但使用小字典和小文本，我得到了一个分割错误（核心转储）错误。
thanks in advance