COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
20, 18, 17, 15, 13, 12, 10
|
|
|
20, 18, 17, 12, 13, 10, 15
|
|
|
20, 18, 17, 10, 12, 13, 15
|
|
|
20, 18, 17, 13, 12, 10, 15
|
Detailed explanation-1: -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. Two new elements ‘10’ and ‘17’ are inserted in the heap in that order, The level-order traversal of the heap after the insertion of the element is.
Detailed explanation-2: -The binary heap is the most efficient method for implementing the priority queue in the data structure.
Detailed explanation-3: -We can use heaps to implement the priority queue. It will take O(log N) time to insert and delete each element in the priority queue. Based on heap structure, priority queue also has two types max-priority queue and min-priority queue.
Detailed explanation-4: -Complexity: Time: O(log n), in the worst case, you will have to bubble up the inserted element up to the root of the tree.