Tries — Prefix Trees for Fast String Lookups

Store strings character by character for O(length) insert and search — plus autocomplete and longest-common-prefix.