Computer Science and Information Technology - CSE

Question of the Day
GATE 2014   CS   Question No. 122

A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is:

GATE Admission Predictor
GATE Coaching Institutes
OR