On which data structure is a d-ary heap based?

Category: QuestionsOn which data structure is a d-ary heap based?
Editor">Editor Staff asked 5 months ago

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 Answers
Editor">Editor Staff answered 5 months ago

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.


Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40701