+1 vote
in Data Structures & Algorithms I by (88.2k points)
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.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct answer is (a) splay tree

Explanation: The pairing heaps insertion, deletion and search time complexity was initially inspired by that of splay trees.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.