Pairing heaps time complexity was inspired by that of?

› Category: Questions › Pairing heaps time complexity was inspired by that of?
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months ago

Pairing heaps time complexity was inspired by that of?
 
(a) splay tree
 
(b) treap
 
(c) red-black tree
 
(d) avl tree
 
My query is from Heap in division Heap of Data Structures & Algorithms I
 
This question was posed to me in an international level competition.

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

Correct answer is (a) splay tree
 
Explanation: The pairing heaps insertion, deletion and search time complexity was initially inspired by that of splay trees.


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: 40702

Related Posts