We have the best collection of Min/Max Heap (Data Structure) MCQs and answer with FREE PDF. These Min/Max Heap (Data Structure) MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

## Min/Max Heap (Data Structure) MCQs

**1. The ascending heap property is ___________**

a) A[Parent(i)] =A[i]

b) A[Parent(i)] <= A[i]

c) A[Parent(i)] >= A[i]

d) A[Parent(i)] > 2 * A[i]

**Answer: **A[Parent(i)] <= A[i]

**2. The procedure FindMin() to find the minimum element and the procedure DeleteMin() to delete the minimum element in min heap take _________**

a) logarithmic and linear time constant respectively

b) constant and linear time respectively

c) constant and quadratic time respectively

d) constant and logarithmic time respectively

**Answer: **constant and logarithmic time respectively

**3. Which one of the following array elements represents a binary min heap?**

a) 12 10 8 25 14 17

b) 8 10 12 25 14 17

c) 25 17 14 12 10 8

d) 14 17 25 10 12 8

**Answer: **8 10 12 25 14 17

**4. In a binary min heap containing n elements, the largest element can be found in __________ time.**

a) O(n)

b) O(nlogn)

c) O(logn)

d) O(1)

**Answer: **O(n)

**5. Min heap is a complete binary tree.**

a) True

b) False

**Answer: **True

**6. What will be the position of 5, when a max heap is constructed on the input elements 5, 70, 45, 7, 12, 15, 13, 65, 30, 25?**

a) 5 will be at root

b) 5 will be at last level

c) 5 will be at second level

d) 5 can be anywhere in heap

**Answer: **5 will be at last level

**7. Descending priority queue can be implemented using ______**

a) max heap

b) min heap

c) min-max heap

d) trie

**Answer: **max heap

**8. Min heap can be used to implement selection sort.**

a) True

b) False

**Answer: **True