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

The height of any rooted tree is defined as the maximum number of edges in the path from the root node to any leaf node.Suppose a Min-Heap T stores 32 keys. The...
#1378 NAT
The height of any rooted tree is defined as the maximum number of edges in the path from the root node to any leaf node.Suppose a Min-Heap T stores 32 keys. The...
#1378 NAT
The height of any rooted tree is defined as the maximum number of edges in the path from the root node to any leaf node.Suppose a Min-Heap T stores 32 keys. The...
#1378 NAT

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......
Question Options

Contributed by: