| ENCYCLOPEDIA 4U .com |
Encyclopedia Home Page |
|
|
TrieA trie is a tree data structure that is used for searching a key/value map. With a trie, the keys are restricted to strings whose alphabet has limited cardinality (e.g. the English alphabet). Each node has at most N+1 children (where N is the cardinality of the alphabet), and all of the children of that node share a common prefix denoted by the node's position and value in the tree.See also search algorithm. 
|
Content on this web site is provided for informational purposes only. We accept no responsibility for any loss, injury or inconvenience sustained by any person resulting from information published on this site. We encourage you to verify any critical information with the relevant authorities.
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Trie".