TRIE

Trie

In computer science, a trie, also called digital tree and sometimes radix tree or prefix tree, is an ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings. Unlike a binary search tree, no node in the tree stores the key associated with that node; instead, its position in the tree defines the key with which it is associated. All the descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string. Values are normally not associated with every node, only with leaves and some inner ...

The above text is a snippet from Wikipedia: Trie
and as such is available under the Creative Commons Attribution/Share-Alike License.

trie

Noun

  1. An ordered tree data structure that is used to store an associative array where the keys are usually strings.

Verb



The above text is a snippet from Wiktionary: trie
and as such is available under the Creative Commons Attribution/Share-Alike License.

Need help with a clue?
Try your search in the crossword dictionary!