initial commit with program that only prints welcome message, also includes travis build config and input txt file
basic trie node struct and readDictionary

wrote basic code to read dictionary file line by line, reverse it, and check if valid then calls storeWordInTrie.
adds test data file and debug messages

adds short dictionary txt file for testing, and prints out each word as it reads it from the data file (only when debug constant is on).
main routine creates empty trie and calls starting function.
takes in suffix user input and calls searchTrieForSuffix.

Also prints out how many it found (still doesn't actually search for any).
stores each word into trie using recursive function, also deletes entire trie from memory.

Tested using valgrind for memory leaks and passed (0 errors). However, the actual results have not been extensively tested yet.
changes test dictionary to more useful choice of words
returns and uses user input length when searching for suffix in trie.
searches for suffix in trie recursively, and keeps track of how many words were found, and keeps track of the word suffix so far (deep in the recursion).
now reverses suffix input when calling search function
traverses trie after finding suffix ending, and stores all words into linked list and prints them out.

Assignment is mostly done, except for a few uninitialized variable errors. Completely free of memory leaks.
ignores printing out first WordNode, which fixes uninitialized memory problem.
converts all words to lowercase when adding them to the trie.
comments and linting fix.
validates user input, only allows alphabetic chars
converts user input to lowercase
Merge branch 'hw5'