Heap: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
=Internal= | =Internal= | ||
* [[ | * [[Data_Structures#Dynamic_Sets|Data Structures]] | ||
=Overview= | =Overview= | ||
Revision as of 01:35, 12 September 2018
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.
TODO CLRS page 151, page 1177.