Tries are the primary data structure used by auto completion and text searching algorithms. They work like a regular Tree but specialized around text.