Print the biggest K elements in a given heap in O(K*log(K))?

Question

Given the following problem , I\'m not completely sure with my current solution :

Question :

Given a maximum heap with n ele

Answer 1

It is a simple and elegant algorithm to get first k elements of a max heap in k log(k) time.

steps:-

1.construct another max heap name it auxiliary heap
2.add root element of main heap to auxiliary heap
3.pop out the element from auxiliary heap and add it's 2 children to the heap
4.do step 2 and 3 till k elements have been popped out from auxiliary heap. Add the popped element's children to the auxiliary heap.