1 It is easiest to implement a heap using an array.

True

False

2 A priority queue is a FIFO data structure.

True

False

3 In an array-based heap, the bottom of the heap is at element 0.

True

False

4 With what efficiency does a dequeue operation for a priority queue implemented as a pointer-based linked list perform? Assume the highest priority node is always the head node.

		O(n)
		O(n2)
		O(logn)
		O(1)

5 The dequeue operation for a priority queue implemented as a heap has a time complexity of

		O(log2n)
		O(1)
		O(n)
		O(n2)

C++. THANK YOU SO MUCH!