What is the purpose of the Min-Heap data structure? Question 18Select one: To find the maximum element To find the minimum element To search for a specific key

Which of the following is the valid min heap?

Operations of Heap Data Structure:

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

Correctly identify the following heap structure by selecting the best answer:Question 16Select one:a.partially ordered heapb.max-heap structurec.priority heapd.min-heap structure

The minimum number of elements in a heap of height h is