Tries Comes from the word retrieval Mostly used for strings Structure   Root represents null string   Each edge defines the next character   Each node stores a string or a preffix of a string   Strings with same preffix share the path Advantages over binary search trees   Search time is where is the length of the query   Size is generally less Related structures: preffix tree, radix tree, suffix tree