Question
Which data structure or concept is best described as a heap in which every parent key is no less than its children’s keys?
Select an option. Your answer will be checked instantly.
Correct Answer: A. Max-Heap
Explanation:
Max-Heap is a heap in which every parent key is no less than its children's keys.
This description distinguishes it from the other choices.
Leave a Reply