Trie

Trie ( prefix Tree ) is a structure which can be searched by prefixes, is an ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings.

Trie is always implemented for the search hints, when you input some texts, the Trie would give you all the possible results starts with the input.