title: What is the Difference Between Maps and Dictionaries in terms of Worst Case Running Time?
body: <p>As the title says.</p>
  
  <p>I have to list the worst case running times for <code>INSERT</code>, <code>DELETE</code>, <code>SEARCH</code>
  for maps and dictionaries, but aren't they both the same?</p>
  
  <p>I.e for AVL tree implemented with MAP or Dictionary, shouldn't
  all 3 operations take O(logn)?</p>