Browse
•
Categories
•
Random
Heap (data structure)
Duration: 2 minutes, 17 seconds
Related Topics:
Heaps
are used to implement
priority queues
.
Locating the maximum element of a
heap
takes
Θ
(1) time, while insertion and the "extract maximum" and "increase key" operations take
O
(log n) time.
Category:
Data structures
References:
Cormen, Thomas H., et al.
Introduction to Algorithms
. 2nd ed. Cambridge: MIT Press, 2001.
Wikipedia
Tags:
heap, binary heap, heap properties, min-heap, max-heap, binary tree, array, priority queue, data structure, computer science animations, computer programming, Flash, learn computer science, study computer science
Home
•
About
•
Links
© 2008 - 2023 Bill Jacobs