- 1 -
1. (4 points) The figure below shows the two arrays used to implement a d-heap for some
value of d. That is, h[x] is the item at position x in the heap and key[i] is the key for item i in
the heap.
Is this a valid heap for d=3? Why or why not?
Is it a valid heap for d=4? Why or why not?
CS 542 โ Advanced Data Structures and Algorithms
Quiz 1
Jonathan Turner 1/25/2012
1
2
3
4
5
6
7
8
9
10
h
e
i
c
b
a
f
d
g
j
h
a
b
c
d
e
f
g
h
i
j
key
8
13
11
17
3
14
10
12
7
19
