Heap

From NovaOrdis Knowledge Base
Revision as of 21:47, 9 October 2021 by Ovidiu (talk | contribs) (→‎INSERT)
Jump to navigation Jump to search

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

INSERT

Insert a node in the tree.

Also see

Data Structures &#124 INSERT

REMOVE-MIN

Remove the node whose key has the minimum value.