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 ”1‘ and ”7‘ are inserted in the heap in that order. The level-order traversal of the heap after the insertion of the elements is:10, 8, 7, 5, 3, 2, 110, 8, 7, 5, 3, 1, 510, 8, 7, 5, 2, 1, 510, 8, 7, 3, 2, 3, 5

A priority queue is implemented as a max-heap initially, it has five elements. The level-order traversal of the heap is as follows: 20, 18, 15, 13, 12. Suppose two new elements ‘10’ and ‘17’ are inserted in the heap in that order. Find the level-order traversal of the heap after the insertion of the element.

We discussed an implementation of a min priority queue as a min heap, which had two key properties.1. The min heap property: the key at a node is at most the keys of its children.2. The heap is represented by a complete binary tree.What is the purpose of the complete binary tree property? Select all that apply.It ensures that the minimum key is at the root of the tree.It allows a simple representation of the tree by a vector in a memory efficient manner.It permits us to tell if a given key is contained in the heap in time 𝑂(log⁡𝑛)O(logn).When the heap has 𝑛n elements it insures that the height of the tree is at most log⁡𝑛logn, which in turn means push and pop can be done in time 𝑂(log⁡𝑛)O(logn).Submit

Heap can be used as :a) Priority queueb) Stackc) A decreasing order arrayd) None of the mentioned

A priority queue can efficiently implemented using which of the following data structures? Assume that the number of insert and peek (operation to see the current highest priority item) and extraction (remove the highest priority item) operations are almost same.ArrayLinkedListHeap Data Structures like Binary Heap, Fibonacci HeapAll of the above

The heap data structure is the most efficient way of implementing the ..................a)Priority queueb)None of the mentionedc)Front queued)Back queue