The Trie is an ordered tree data structure used usually to store strings, in which case each node defines an association with a letter of the alphabet. 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.
Sebastia, L.; Garcia, I.; Onaindia, E.; Guzman, C.
Universidad Politècnica de València,
Issue Date: Nov. 3-5 , 2008 ISBN: 978-0-7695-3440-4 Core: B
Page 4 of 4