title: Why do we need hashcode and bucket in LinkedHashMap
body: <p>Lately,I've been going through implementations of <code>Map</code> interface in <code>java</code>. I understood <code>HashMap</code> and everything made sense.
  But when it comes to <code>LinkedHashMap</code>, as per my knowledge so far, the Entry has <code>key</code>, <code>value</code>, <code>before</code> and <code>after</code>. where before and after keeps track of order of insertion.</p>
  <p>However, using <code>hashcode</code> and bucket concept doesn't make sense to me in <code>LinkedHashMaps</code>.</p>
  <p><a href="http://www.javamadesoeasy.com/2015/02/linkedhashmap-custom-implementation.html" rel="nofollow noreferrer">I went through this article for understanding implementation of linkedHashMaps</a></p>
  <p>Could someone please explain it? I mean why does it matter in which bucket we put the entry node. In fact why bucket concept in the first place.? why not plain doubly llinked lists?</p>