Linear Probing Deletion

Goals

Students will understand elements of the deletion algorithm for open addressing with linear probing in hash tables.

Video

Materials

One deck of Menagerie cards.

this is a placeholder image
Sample cards from the Menagerie deck.

Setup

Give each student a set of 0-7 number cards. Set these cards in a row, ordered from 0 on the left to 7 on the right.

Number cards form the Menagerie deck
Number cards from the Menagerie deck.

Shuffle the animal cards from the deck and deal each student 7 cards.

Each student should use their cards and follow the insertion algorithm.

Algorithm

The first step is finding the card we are looking to delete.

Check under the numbered card corresponding to the key of the card we are looking for.

If there is a different card stored here or if there is no card and the numbered card is flipped, look at the spot to the right. Continue checking the card to the right until you encounter an empty space under a numbered card that isn’t flipped or the card we are looking for.

If we’ve found the card we are looking for, we remove it. Since we removed it we must flip the numbered card above it.

Example

For this example we are using a Hash table containing the Tiger, Snake, Barracuda, Quelea, Boar, Sheep, Baboon, and Hummingbird cards.

Number cards form the Menagerie deck
Number cards from the Menagerie deck.

Deleting the Quelea

When hashed the Quelea card has a key of 4, so we look under the numbered card 4.

There is a different card stored in this spot, so we look at the spot to the right.

The spot to the right stores the Quelea card, so we remove it and flip the numbered card 5 above it.

Quelea removed from hash table and number 5 flipped.
Quelea removed from hash table and number 5 flipped.

Deleting the Baboon

When hashed the Baboon card has a key of 5, so we look under the numbered card 5.

There is no card stored in this spot and the numbered card is flipped, so we look at the spot to the right.

The spot to the right stores a different card Boar, so we look at the spot to the right again.

The spot to the right stores a different card Hummingbird, so we look at the spot to the right again.

The spot to the right stores the Baboon card, so we remove it and flip the numbered card 0 above it.

Baboon removed from hash table and number 0 flipped.
Baboon removed from hash table and number 0 flipped.

Deleting the Tiger

When hashed the Tiger card has a key of 1, so we look under the numbered card 1.

There is a different card stored in this spot, so we look at the spot to the right.

The spot to the right stores a different card Barracuda, so we look at the spot to the right again.

The spot to the right stores the Tiger card, so we remove it and flip the numbered card 3 above it.

Tiger removed from hash table and number 3 flipped.
Tiger removed from hash table and number 3 flipped.

Exercises

Evaluation