Hashing operations
A hash function turns a key straight into a bucket number — here key % SIZE — so insert, search and delete
jump to one bucket instead of scanning everything. Keys that land in the same bucket (a collision) are chained in a list.
In the hash table a key goes to bucket key % SIZE, and keys that collide are chained in a list.
Time complexity
For a table holding n keys spread over SIZE buckets by a good hash function. The highlighted row is the operation you are visualizing.