title: Worse case time complexity put/get HashMap
body: <p>What is the worst case time complexity of an Hashmap when the hashcode of it's keys are always equal.</p>
  
  <p>In my understanding: As every key has the same hashcode it will always go to the same bucket and loop through it to check for equals method so for both get and put the time complexity should be O(n), Am I right?</p>
  
  <p>I was looking at this <a href="https://stackoverflow.com/questions/4553624/hashmap-get-put-complexity">HashMap get/put complexity</a> but it doesn't answer my question.</p>
  
  <p>Also here <a href="http://en.wikipedia.org/wiki/Hash_table" rel="noreferrer">Wiki Hash Table</a> they state the worse case time complexity for insert is <strong>O(1)</strong> and for get O(n) why is it so?</p>