Multiple choice question for engineering Set 1 1. With what data structure can a priority queue be implemented? a) Array b) List c) Heap d) All of the mentioned AnswerAnswer: d [Reason:] Priority queue can be implemented using an array, a list, a binary search tree or a heap, although the most efficient one being…
This content is for paid premium members only.
You can view complete answer after activation your membership.
Need only one answers. Simply buy single day pass and email. We will send answers for this question.
Login Buy membership