Two Types of Hash Tables:
Simple Hash Table:
- Stores single values (strings)
- Similar to a basic array with hashed indices
- Example: "hello" → index 0
Key-Value Hash Table:
- Stores pairs of values (like a dictionary)
- The key is hashed to determine storage location
- Example: "name": "John" → index 0
- More like real-world hash table implementations
Operations:
- Insert: Adds a value (or key-value pair) at its computed hash index
- Delete: Removes a value (or key-value pair) from its hash index
- Search: Finds a value (or key-value pair) by computing its hash index
Note: This is a teaching tool to visualize how hash tables work internally. Real hash tables (like JavaScript objects) use more sophisticated hashing algorithms.