when an element is insertedit will be appended to the list that corresponds to that element' hash value that isif you have two elements that both have the hash value these two elements will both be added to the list that exists in slot of the hash tablethe preceding diagram shows list of entries with hash value chaining then avoids conflict by allowing multiple elements to have the same hash value it also avoids the problem of insertions as the load factor increasessince we don' have to look for slot moreoverthe hash table can hold more values than the number of available slotssince each slot holds list that can grow of courseif particular slot has many itemssearching them can get very slowsince we have to do linear search through the list until we find the element that has the key we want this can slow down retrievalwhich is not goodsince hash tables are meant to be efficientthe preceding diagram demonstrates linear search through list items until we find match