Question

What will be the position of 5, when a max heap is constructed on the input elements 5, 70, 45, 7, 12, 15, 13, 65, 30, 25?

(a) 5 will be at root

(b) 5 will be at last level

(c) 5 will be at second level

(d) 5 can be anywhere in heap

I would like to ask this question from Heap topic in division Heap of Data Structures & Algorithms I

The question was posed to me during an online interview.

Answer 1

Right option is (b) 5 will be at last level

Best explanation: In max heap the greatest element is at the root and the smallest elements are at the last level. As 5 is the smallest input element, it will be at the last level.