GATE CS 2015 Set 2 — Question 41

Multiple choice 2 marks Question 41 2015

Question 41

MCQ 2 marks · −0.66 Programming and Data Structures

Consider a max-heap stored in an array using the usual level-order (breadth-first) representation:

40, 30, 20, 10, 15, 16, 17, 8, 4

The value 35 is now inserted into this heap. After the insertion, the array representing the heap is:

Answers and explanations are free — they just need an account.

Where this question comes from

Source: GATE 2015 Computer Science and Information Technology, Set 2, Q41 (set and question number approximate)