ContactUs :

Please send your Questions & Answers or Feedback to "mohan@javabook.org"

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

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.
Related Posts Plugin for WordPress, Blogger...
Flag Counter