The document explains how to implement a priority queue using either an unsorted array or a binary heap. It outlines the complexity of insertion and deletion: in a binary heap, the insertion complexity is O(log n), while in an unsorted array, the insertion complexity is O(n) due to the need to find the position before inserting.

1. One can implement a priority queue by an unsorted array or a binary heap. What is the
complexity of insertion and deletion (in big-O notation), if (a) you use a binary heap, or (2) you
use an unsorted array?
Solution
Complexity of insertion in Bunary Heap : O(logn), because height of tree remains O(logn)
Complexity of insertion in unsorted array: O(n), beacause you have to first find the position in
array that itself take O(n) and again insertion takes O(n)