Question

A Priority-Queue is implemented as a
Max-Heap. Initially, it has 5
elements. The level-order traversal of
the heap is given below: 10, 8, 5, 3, 2
Two new elements "l' and "7' are in-
serted in the heap in that order. The
level-order traversal of the heap after
the insertion of the elements is:
A. 10, 8, 7,5, 3, 2, 1
B. 10, 8, 7, 2, 3, 1,5
C. 10, 8, 7, 1,2,3,5
D. 10,8,7, 3, 2, 1,5​

Answer 1

Explanation:

D) 10,8,7,3,2,1,5.

PLEASE MARK ME AS BRAINLIST ANSWER......