Which operation is not efficiently performed in a d-heap?

› Category: Questions › Which operation is not efficiently performed in a d-heap?
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months ago

Which operation is not efficiently performed in a d-heap?
 
(a) insert
 
(b) delete
 
(c) find
 
(d) merge
 
The origin of the question is Heap in chapter Heap of Data Structures & Algorithms I
 
I had been asked this question by my school principal while I was bunking the class.

Question Tags:
1 Answers
0 Vote Up Vote Down
Editor">Editor Staff answered 5 months ago

Right option is (d) merge
 
The best I can explain: Unlike find operation, which cannot be performed in a d-heap, the task of merging two d-heaps is very difficult.


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

Related Posts