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