a collection of items organized hierarchically where, if we assume the root is at level 0, a node at level is associated with the i-th character of the key. The branching ratio is high, and efficient lookup of words is possible if compression of the data structure does not unduly slow search.
a data structure similar to but different to a tree
a data structure that stores an associative array with string-valued keys
a digital search tree in which leaves correspond to records in a file
a distributed-key search tree in which records from a file correspond to leaves in the tree
a k-ary tree with letters labelling edges
a search tree scheme that employs the structure of search keys to organize information
a tree for storing strings in which there is one node for every common prefix
a tree-like data structure where each node represents a letter
a tree structure for storing strings and has been used to store large dictionaries of words for spell checking programming and natural language processing
a tree structure where the branching occurs according to "digits" of the keys, rather than according to comparisons of the keys
a tree, which means you can visualize it as an upside down bush
a type of tree that has N possible branches from each node, where N is the number of characters in the alphabet
a digital tree, in which a multiway branch occurs at each level, such as for the letters of the alphabet, where information entered is represented by the path from the root to a node (possibly leaf) marked as "final"
In computer science, a trie, or prefix tree, is an ordered tree data structure that is used to store an associative array where the keys are strings. Unlike a binary search tree, no node in the tree stores the key associated with that node; instead, its position in the tree shows what key it is associated with. All the descendants of any one node have a common prefix of the string associated with that node, and the root is associated with the empty string.