+1 vote
in Data Structures & Algorithms I by (88.2k points)
On which data structure is a d-ary heap based?

(a) stack

(b) queue

(c) linked list

(d) priority queue

I'd like to ask this question from Heap in portion Heap of Data Structures & Algorithms I

The question was posed to me in a national level competition.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Correct choice is (d) priority queue

The best explanation: d-ary heap is a priority queue based data structure that is a generalization of binary heaps.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.