Vidyalelo
Data Structure · Q138

Heaps

Programming · Data Structure · question 138

Q138

What is the time per operation of merging, insertion and deletion operations in a skew heap?

A.
O(N)
B.
O(log N)
Answer
C.
O(N log N)
D.
O(N2)

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board