Heap: Difference between revisions

From NovaOrdis Knowledge Base
Jump to navigation Jump to search
Line 5: Line 5:
=Overview=
=Overview=


A '''binary heap''' data structure is an array where data is placed to form a [[Tree#Binary_Tree|binary tree]].
A '''binary heap''' data structure is an array where data is placed to form a complete [[Tree#Binary_Tree|binary tree]].


<font color=darkgray>TODO [[CLRS]] page 151, page 1177.</font>
<font color=darkgray>TODO [[CLRS]] page 151, page 1177.</font>

Revision as of 02:59, 13 August 2018

Internal

Overview

A binary heap data structure is an array where data is placed to form a complete binary tree.

TODO CLRS page 151, page 1177.