Generic Trie/Prefix Tree Implementation

So I needed some implementation that would allow me to lookup string values and branch results off based on what I was looking for. Typically this is the appropriate job for what is called a Trie or otherwise a Prefix Tree. You may look up "A" then "AB" then "ABC" and with each additional character typed out, you would traverse a treelike structure that would provide you with the remainder of characters associated with all the possible strings contained in the structure.

I ended up writing...

Read more