A priority queue is
A) a binary search tree in which the heights of the subtrees at each node differ by at most one
B) is an AVL tree in which the root is the minimum element
C) is a binary search tree that stores elements according to their natural order
D) is a collection that allows elements to be added,but only allows the minimum element to be removed

Question

Quizplus · Accepted Answer

A priority queue is a data structure that allows elements to be added but only allows the minimum element to be removed. This is different from binary search trees, AVL trees, or binary search trees that store elements according to their natural order. Therefore, the best choice is D.

A Priority Queue Is