Heaps MCQ question and answer with solution | Data Structure MCQs

A. It provides efficient insertions and deletions.

B. It maintains elements in sorted order.

C. It allows quick search operations.

D. It uses less memory.

A. The heap property is maintained by moving the node up the tree.

B. The node is removed and the heap is restructured.

C. The node is placed at the end of the heap.

D. The heap property is maintained by moving the node down the tree.

A. Extract-Min

B. Extract-Max

C. Remove-Root

D. Delete-Min

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

A. For implementing priority queues and heapsort.

B. For managing hierarchical data.

C. For balancing binary search trees.

D. For efficient searching.

A. Insert

B. Find minimum

C. Delete minimum

D. Both Insert and Delete minimum

A. A binary heap does not maintain a sorted order while a binary search tree does.

B. A binary heap maintains a sorted order while a binary search tree does not.

C. Binary heaps are always balanced while binary search trees are not.

D. Binary heaps have only one child per node, binary search trees have two.

A. By performing a heapify operation.

B. By reordering the entire heap.

C. By inserting a new maximum element.

D. By balancing the tree manually.

A. The root is the smallest element.

B. Each parent node is less than or equal to its children.

C. All levels of the heap are completely filled except possibly the last.

D. The root is the largest element.

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)