What is the time complexity of inserting a single element into a heap of N elements and ensuring that heap ordering semantics are maintained?

(a) O(1) (b) O(log N) (c) O(N) (d) O(N log N)

What is the time complexity of removing all elements in descending order from a heap containing N elements?

(a) O(1) (b) O(log N) (c) O(N) (d) O(N log N)

Which of the following applications is a heap NOT particularly well suited to?

(a) implementing heapsort (b) implementing a priority queue (c) permitting rapid access to the largest of a partially ordered set of elements (d) maintaining a full ordering of elements across multiple insertions and deletions