Encyclopedia > Trie

  Article Content

Trie

A trie is a tree data structure that is used for searching a key/value map. In the case of 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.



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
Shoreham, New York

... States Census Bureau, the village has a total area of 1.1 km² (0.4 mi²). 1.1 km² (0.4 mi²) of it is land and none of the area is covered with water. ...

 
 
 
This page was created in 30.6 ms