1 is returned by the peek operation on the following priority queue.
The smallest value in a min-heap is returned by peak operation.
Heap:
By creating a min-heap or max-heap using the elements of the supplied array, the elements of a heap sort are processed. The root component or element of an array's sequence, which reflects the array's minimal or maximal element, can be described using either of the heaps (max or min). We will study more about heap sort algorithms in this article. When it comes to the heap sort, the elements are primarily sorted in the following two steps: To construct a heap, the array's elements must first be changed. Next, move the heap's root component to the end of the array and hold the heap structure with the left components while continually removing it.
To learn more about Heap visit: https://brainly.com/question/20230647
#SPJ4
