Heap: Difference between revisions

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


This article is about '''binary heaps'''. 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.
This article is about '''binary heaps'''. 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. Each element of the array contains a pointer to tree [[Tree_Concepts#Node|nodes]]. Each node contains at least a key.
 
Each element of the array contains a pointer to tree [[Tree_Concepts#Node|nodes]]. Each node contains at least a key.


<font color=darkkhaki>More details [[CLRS]] page 151, page 1177.</font>
<font color=darkkhaki>More details [[CLRS]] page 151, page 1177.</font>


=Supported Operations=
=Supported Operations=

Revision as of 21:41, 9 October 2021

External

Internal

Overview

This article is about binary heaps. 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. Each element of the array contains a pointer to tree nodes. Each node contains at least a key.

More details CLRS page 151, page 1177.

Supported Operations