Question
Which data structure or concept is best described as a collection of heap-ordered trees using lazy consolidation?
Select an option. Your answer will be checked instantly.
Correct Answer: A. Fibonacci Heap
Explanation:
Fibonacci Heap is a collection of heap-ordered trees using lazy consolidation.
This description distinguishes it from the other choices.
Leave a Reply