If there are c children of the root, how many calls to the merge procedure is required to reassemble the heap?

Category: QuestionsIf there are c children of the root, how many calls to the merge procedure is required to reassemble the heap?
Editor">Editor Staff asked 4 weeks ago

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 Answers
Editor">Editor Staff answered 4 weeks ago

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.