A minimal implementation of a trie data structure for Go. Differs
from most implementations in that it uses string slices ([]string) as keys,
rather than just strings.
This makes it suitable for efficiently storing information about hierarchical systems in general, rather than being specifically geared towards string lookup.
Read the documentation on godoc.org for details of how to use trie.