Important Notice: Our web hosting provider recently started charging us for additional visits, which was unexpected. In response, we're seeking donations. Depending on the situation, we may explore different monetization options for our Community and Expert Contributors. It's crucial to provide more returns for their expertise and offer more Expert Validated Answers or AI Validated Answers. Learn more about our hosting issue here.

How does a Hashtable internally maintain the key-value pairs?

April 26, 2017hashtable internally maintain pairs

0

Posted

How does a Hashtable internally maintain the key-value pairs?

1 Answer

0

Posted

Location: http://www.jguru.com/faq/view.jsp?EID=43224 Created: May 2, 2000 Modified: 2000-05-02 05:15:12.121 Author: Frank Steidinger (http://www.jguru.com/guru/viewbio.jsp?EID=34216) Question originally posed by Pramod Hirole (http://www.jguru.com/guru/viewbio.jsp?EID=41443 The Hashtable class uses an internal (private) class named Entry to hold the key-value pairs. All entries of the Hashtable are stored in an array of Entry objects with the hash value of the key serving as the index. If two or more different keys have the same hash value these entries are stored as a linked list under the same index.