Question

If we implement heap as maximum heap , adding a new node of value 15 to the  left most node of right subtree. What value will be at  leaf nodes of the right subtree of the heap.

(a) 15 and 1

(b) 25 and 1

(c) 3 and 1

(d) 2 and 3

This question is from Heap in chapter Heap of Data Structures & Algorithms I

The question was posed to me in my homework.

Answer 1

Right option is (a) 15 and 1

The best explanation: As 15 is less than 25 so there would be no violation and the node will remain at that position. So leaf nodes with value 15 and 1 will be at the position in right sub tree.