C++ QUESTION.!

1 A heap has the property where any node has a value greater than it's left child, but less than it's right child.

True

False

2 In a priority queue implemented using a binary search tree, the bottom of the heap is the root node.

True

False

3 If a priority queue is implemented using a binary search tree, the highest priority item would always be a leaf.

True

False

4 Heaps can be used to sort arrays.

True

False

5 Which implementation of a priority queue has the most efficient dequeue operation.

		heap
		binary search tree
		Linked List

Thank you so much!