Copyright (c) 2016 Robin Luiten
An implementation of a Trie data structure.
A trie is an ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings.
In this implementation they keys are strings.
To execute tests run TestRunner.elm in tests folder.
To see tests look at TrieTest.elm in tests folder.
Possible TODO