Heap: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| Line 3: | Line 3: | ||
=Internal= | =Internal= | ||
* [[Data_Structures#Dynamic_Sets|Data Structures]] | * [[Data_Structures#Dynamic_Sets|Data Structures]] | ||
* [[Tree Concepts]] | |||
* [[Tree_Representation_in_Memory#Representing_Rooted_Trees_in_an_Array|Tree Representation in Memory]] | |||
=Overview= | =Overview= | ||
Revision as of 21:35, 9 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.