題組內容

3. Answer the following questions with either true or false. Assume there are n elements in the
data structure.

c. Returning the maximum element in a max-heap (but not deleting it from the heap) can be
done in time O(1). (4%)