hash tables same red and green components will be stored in the same chainwith only the blue components differing figure illustrates this - array of linked lists ** ** figure - array of linked lists used to store color counts in color histogram given digital image consisting of distinct pixelsall of which may contain unique colorsthe histogram can be constructed in linear time this time is derived from the fact that searching for the existence of color can be done in constant time locating the specific - array entry in which the color should be stored is direct mapping to the corresponding array indices determining if the given color is contained in the corresponding linked list requires linear search over the entire list since all of the nodes in the linked list store colors containing the same red and green componentsthey only differ in their blue components given that there are only different blue component valuesthe list can never contain more than entries thusthe length of the linked list is independent of the number of pixels in the image this results in worst case time of ( to search for the existence of color in the histogram in order to increment its count or to add new color to the histogram search is required for each of the distinct image pixelsresulting in total time (nin the worst case after the histogram is constructeda traversal over the unique colors contained in the histogram is commonly performed we could traverse over the entire - arrayone element at timeand then traverse the linked list referenced from the individual elements but this can be time consuming since in practicemany of the elements will not contain any colors insteadwe can maintain single separate linked list that contains the individual nodes from the various hash chainsas illustrated in figure when new color is added to the histograma node is