History of Trie

	Revision 6 . . (edit) December 16, 2001 12:06 pm by Bignose [copyedit, BFUOT]
	Revision 5 . . (edit) December 10, 2001 9:38 am by Taral [Still wrong]
	Revision 4 . . (edit) December 10, 2001 9:38 am by Taral [Okay, I was wrong]
	Revision 3 . . (edit) December 10, 2001 9:37 am by Taral
	Revision 2 . . December 10, 2001 9:36 am by Taral
	Revision 1 . . December 10, 2001 9:35 am by Taral [Initial definition]

---

Difference (from prior major revision) (minor diff, author diff)

Changed: 1c1

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.

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.

Changed: 3c3

See search algorithm

See also search algorithm.