(d) Draw the binary min heap that results from inserting 12, 9, 14, 16, 4, 17, 6, 8, 2 in that order into an initially empty binary heap. Draw the final tree. (10%)

7. Given a hash function as follows: The size of the hash table is 7. Linear probing is used to resolve collisions. The hash function used is H(k) = k mod 7 Suppose that the hash table is initially empty. What values will be in the hash table after the following sequence of insertions? 15,26,29,19,8 Draw the contents of the hash table as shown below. (5%)

題組內容

(d) Draw the binary min heap that results from inserting 12, 9, 14, 16, 4, 17, 6, 8, 2 in that order into an initially empty binary heap. Draw the final tree. (10%)

相關申論題

相關試卷