My code works fine when I don't use the large dictionary, but when I do use it, I get a segmentation fault. When I use GDB, the problem is so far into the dictionary that it would take forever to get to the part of my code that causes the seg fault. My code is below. I have implemented a trie whose leaf nodes branch off into linked lists that contain possible word endings, because I wanted to see if this would take less time to load because I am not instantiating a new trieNode for every single letter. DICTIONARYSIZE is the number of layers to the trie. I use trieNavigate() both to load and to check, and I know that works properly.
I only get a seg fault now with a large dictionary. I don't know why though... It works with supercalifragilisticexpialidocious.
EDIT: My code can check words correctly now
[Code removed to comply with academic honesty code]