what a trie is, it's a kind of a balanced ordered tree, not incredibly unlike the splay tree that we already looked at and some of it's branch, but tries rely on bitwise operations to find the descendants of nodes in order to get really high performance and really low-memory footprints.