Heap: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| Line 1: | Line 1: | ||
=External= | |||
* https://www.coursera.org/learn/algorithms-graphs-data-structures/lecture/iIzo8/heaps-operations-and-applications | |||
=Internal= | =Internal= | ||
* [[Data_Structures#Dynamic_Sets|Data Structures]] | * [[Data_Structures#Dynamic_Sets|Data Structures]] | ||
Revision as of 21:58, 8 October 2021
External
Internal
Overview
A binary heap data structure is an array where data is placed to form a complete binary tree, plus the index of the last node in the heap.
More details CLRS page 151, page 1177.