Question
Consider the hash table of
capacity 7 below.
Suppose that for integer key
k and table
capacity
c, we define the hash function
h(k) = k mod c
Show how the hash table looks after elements with the following keys are
inserted into the table in the following order:
19, 13, 31, 20, 24, 16
Answer
Question
Below is the binary heap structure from Question 1:
Draw the heap structure after the lowest-key item has been removed.
Answer
Question
Below is the binary heap structure from Question 1:
Draw the heap structure after a new item with key
1 has been added.
Answer