Consider a situation in which a user has numeric keys and wishes to have
a priority queue that is
maximum-oriented. How could a standard (minoriented)
priority queue be used for such a purpose?
Illustrate the execution of the in-place heap-sort algorithm on the following
input sequence: (2,5,16,4,10,23,39,18,26,15).
Let
T
be a complete binary tree such that position
p
stores an element
with key
f
(p), where
f
(p) is the level number of
p
(see Section 8.3.2). Is
tree
T
a heap? Why or why not?