Chapter 24, Problem 8PE

Explanation of Solution

Pseudo code:

delete(value K_i)

begin

    j=first i high-order bits of h(K_i);

    delete value K_i from bucket j;

    coalesce (bucket j);

    end

    coalesce (bucket j)

    begin

        i_j = bits used in bucket j;

  k = any bucket with first (i_j - 1) bits same as that

  of bucket j while the bit i_j is reversed;

i_k = bits used in bucket k;

if (i_j ≠ j_k)

    //bucket cannot be merged.

  return;

        if (entries in j + entries in k > bsize)

            //buckets cannot be merged

     &...