EasyRememberHeaps & Priority QueuesMultiple Choice
What is the heap invariant for a min-heap?
Remember — Tests recall of fundamental facts and definitions.
Answer Options
AEach node is greater than its children
BEach node is less than or equal to its children
CAll leaves are at the same level
DEach level is sorted left to right
Want to see the correct answer?
Get the answer with a detailed explanation, plus practice 31+ more Heaps & Priority Queues questions with adaptive quizzes and timed interviews.
See the Answer on Guru Sishya →This question is from the Heaps & Priority Queues topic (Data Structures).
More Heaps & Priority Queues Questions
In a min-heap stored as an array, what is the parent index of the node at index i?
EasyWhat is the time complexity of extracting the minimum from a min-heap?
EasyWhat is the time complexity of peek() (see minimum without removing) in a min-heap?
EasyWhy use a min-heap of size k to find the kth LARGEST element?
Medium-EasyWhat is the time complexity of building a heap from n elements (Floyd's heapify)?
Medium-Easy