From LiteratePrograms
Jump to: navigation, search

A trie is an efficient map data structure for maps with string keys. No strings are stored in the tree, and lookup is less expensive than in a binary search tree because only comparisons of single characters are performed. Tries can also implement maps with integer keys, which can be seen as strings of bits.

This category currently contains no pages or media.