Beginner
Data Structures & Algorithms
Q11 / 100
What is a min-heap?
Correct! Well done.
Incorrect.
The correct answer is B) A complete binary tree where every parent is less than or equal to its children
B
Correct Answer
A complete binary tree where every parent is less than or equal to its children
Explanation
A min-heap ensures the minimum element is always at the root. insert and extract-min take O(log n) by bubbling up or down.
Progress
11/100