Heap: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 6: | Line 6: | ||
=Overview= | =Overview= | ||
A '''binary heap''' data structure is an array where data is placed to form a complete [[ | A '''binary heap''' data structure is an array where data is placed to form a complete [[Tree_Concepts#Binary_Tree|binary tree]], plus the index of the last node in the heap. | ||
<font color=darkkhaki>More details [[CLRS]] page 151, page 1177.</font> | <font color=darkkhaki>More details [[CLRS]] page 151, page 1177.</font> | ||
Revision as of 20:17, 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.