Heaps MCQ question and answer with solution | Data Structure MCQs

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

A. For implementing priority queues.

B. For managing hierarchical data.

C. For sorting elements.

D. For balancing search trees.

A. (i - 1) / 2

B. (i + 1) / 2

C. (i - 1) / 2 if i is even, else (i - 1) / 2

D. (i - 1) / 2 for i > 0

A. The heap property is restored by moving the node down.

B. The node is removed, and a new node is added.

C. The heap property is restored by moving the node up.

D. The heap becomes unbalanced.

A. Searching for an arbitrary element

B. Inserting an element

C. Extracting the maximum/minimum

D. Building a heap

A. 2 * i + 1

B. 2 * i

C. 2 * i + 2

D. 2 * i - 1

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

A. Bubble-up or Percolate-up

B. Bubble-down or Percolate-down

C. Heapify

D. Restructure

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

A. Min-heap

B. Max-heap

C. Fibonacci heap

D. Binomial heap