Computer Sciences > GATE 2015 SET-1 > Heaps
Consider a max heap, represented by the array:
Now consider that a value 35 is inserted into this heap. After insertion, the new heap is
A
40, 30, 20, 10, 15, 16, 17, 8, 4, 35
B
40, 35, 20, 10, 30, 16, 17, 8, 4, 15
C
40, 30, 20, 10, 35, 16, 17, 8, 4, 15
D
40, 35, 20, 10, 15, 16, 17, 8, 4, 30

Correct : d

Similar Questions

An array is [82, 101, 90, 11, 111, 75, 33, 131, 44, 93] heapified. Which one of the following options represents the first three elements in the heapified array...
#877 MCQ
Consider a binary min-heap containing 105 distinct elements. Let k be the index (in the underlying array) of the maximum element stored in the heap. The number...
#879 MCQ
Let H be a binary min-heap consisting of n elements implemented as an array. What is the worst case time complexity of an optimal algorithm to find the maximum...
#1067 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......