An unordered list contains $$n$$ distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is

A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is:

A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?

What is the number of swaps required to sort n elements using selection sort, in the worst case?