Page 102 - Data Structures Handout_Neat
P. 102
This simple example shows how keys are mapped to indices using the division method.
However, it does not yet handle collisions.
9.3.2 Operations: Insertion, Deletion, Searching
Hash tables support three fundamental operations:
• Insertion: Compute the index using the hash function and place the key in that
position.
• Deletion: Locate the key using the hash function and remove it.
• Searching: Compute the index and check if the key exists at that position.
Example: Insertion and Searching in C++
102
