+1 vote
in Data Structures & Algorithms I by (88.2k points)
If there are c children of the root, how many calls to the merge procedure is required to reassemble the heap?

(a) c

(b) c+1

(c) c-1

(d) 1

Asked question is from Heap in division Heap of Data Structures & Algorithms I

This question was addressed to me in class test.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
Correct answer is (c) c-1

Best explanation: If there are c children of the root, then c-1 merges are required to reassemble the pairing heap.

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.

Categories

...