Question 1

What is the difference between a min-heap and a max-heap?

Accepted Answer

In a min-heap, the parent node is always smaller than or equal to its children, so the minimum element is at the root. In a max-heap, the parent node is always greater than or equal to its children, so the maximum element is at the root.

Question 2

What are the time complexities of insertion and deletion in a heap?

Accepted Answer

The time complexity for both insertion (adding an element) and deletion (extracting the min/max element) in a heap is O(log n), where n is the number of elements in the heap. This is because the height of the heap is log n, and these operations require traversing the height of the tree.

Heap Data Structure Interview Questions and Answers

Related Algorithm Guides