Heaps MCQ question and answer with solution | Data Structure MCQs

A. The elements are not in any specific order.

B. The elements are sorted in ascending order.

C. The elements are sorted in descending order.

D. The elements follow the heap property.

A. Binary heap

B. Fibonacci heap

C. Binomial heap

D. AVL heap

A. O(log n)

B. O(n log n)

C. O(n)

D. O(n²)

A. To find the minimum element efficiently.

B. To find the maximum element efficiently.

C. To sort elements in descending order.

D. To balance binary search trees.

A. 2 * i + 2

B. 2 * i + 1

C. (i - 1) / 2

D. 2 * i

A. They both maintain a complete binary tree.

B. They both ensure a sorted order of elements.

C. They both allow easy insertion and deletion.

D. They both balance themselves automatically.

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

A. The heap grows by adding nodes to the end.

B. The heap automatically rebalances itself.

C. The heap elements are sorted.

D. The heap size must be manually adjusted.

A. (i - 1) / 2

B. (i + 1) / 2

C. (i + 2) / 2

D. (i - 2) / 2

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)