In one of my books that I'm reading for fun it has a question which says Show the result of inserting the keys 10111101, 00000010, 10011011, 10111110, 01111111, 01010001, 10010110, 00001011, 11001111, 10011110, 11011011, 00101011, 01100001, 11110000, 01101111 into an initially empty extendible hashing data structure. Each bucket can store 4 keys. I've tried looking online for ways to do this but i'm stuck, does anyone know what inserting keys into initially extendible hashing data structure does or how its affected differently?

New contributor
user3117455 is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct.
  • $\begingroup$ The answer depends on how the hash table is implemented. You will have to provide more details. Once you do provide the details, you will probably be able to work it out on your own – say by actually programming it. $\endgroup$ – Yuval Filmus 2 days ago

Your Answer

user3117455 is a new contributor. Be nice, and check out our Code of Conduct.

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.