Trie

A type of tree structure designed for mapping a set of keys to associated values. Each level of the tree is indexed by a character in the key to determine the next node to look at. The bitwise variant of this structure uses the bits of an integer value to index into the structure and retrieve the corresponding data.

Further Reading

• Trie
• Radix Tree
• Hash Array Mapped Trie
• https://www.techiedelight.com/trie-implementation-insert-search-delete/
• http://www.mathcs.emory.edu/~cheung/Courses/323/Syllabus/Text/trie01.html
• https://github.com/panosalbanis/bitwise-trie/blob/master/trie.c
• http://www.cs.yale.edu/homes/aspnes/pinewiki/RadixSearch.html