The worst case running time of all operations in a skew heap is given as?

› Category: Questions › The worst case running time of all operations in a skew heap is given as?
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months ago

The worst case running time of all operations in a skew heap is given as?
 
(a) O(N)
 
(b) O(N log N)
 
(c) O(N^2)
 
(d) O(M log N)
 
My query is from Heap topic in section Heap of Data Structures & Algorithms I
 
The question was posed to me in an online interview.

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

The correct answer is (a) O(N)
 
Easiest explanation – The worst case running time of all operations in a skew heap is mathematically found to be O(N).


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