title: Which data structure would have the optimal expected asymptotic performance when finding words with a common prefix?
body: <p>given the task of finding words which share a common prefix with a given word, which data structure would have the optimal expected asymptotic performance?</p>
  
  <p>Multiple choice:
  a) binary tree
  b) hash set
  c) sorted array
  d) trie</p>
  
  <p>Thanks!</p>